Question:-cyber attack in graph challenge

#1

I am not able to think how to start this question.Help me by some hint.

#2

Hey @vaibhav5147
You need to use prim’s or kruskal’s algo to create a spanning tree but with sum of edges to be max
Then for all unused edges, sort them in ascending order and keep adding their breaking cost and count till weight is <= max money

#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.