Hello, can you please show me how to do the following problem. I am very lost. Thank you so much for the help.

STUDY PROBLEM 1 For a given real-world problem like the one below, which of the algorithm will you use to solve it? How would you map the input information into the input required by the algorithm? What computational complexity the chosen algorithm has? Blizzard has come over the whole state, covering all highways with 40 inches ofsnow. To keep the distribution of food, roads between major cities need to be cleared, so that each major city can be reached from each other. But getting rid of the snow from a highway is expensive - S1000 per mile. You, member of the Emergency Services, need to devise a plan that keeps all major cities connected through cleared roads, with the cost of clearing as small as possible. You are given the list of distances (in miles) of direct connections (i.e. not going through any other major city) between the major cities. You have to do the math, and choose which of those connections should be cleared What algorithm would you use? How would you map the real-world problem above nto abstract problem solved by the algorithm you have chosen