I am not able to approach the question

#1

Help me with the approach

#2

Hi,

First calculate the maximum spanning tree(using minimum spanning tree algorithm). Now, sort the remaining edges(not covered in spanning tree) in ascending order and subtract the cost of edges from total money untill whole money is spent.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.