800 islands are connected with many two-way bridges (i.e. lines, not arrows).

You know the cost of maintaining each bridge (weights on the edges).

You want to minimize the total maintenance cost by eliminating some bridges while leaving all the islands connected.

18) What algorithm would you use to solve this problem? (Algorithm for finding what?)

* (3 pts) Algorithm for finding

b. How many bridges will you end up with if you used this algorithm for 800 islands? How many bridges for N islands (formula in terms of N)?

* (2 pts) For 800 islands (N = 800), how many bridges? (exact number):

*(3 pts) For N islands, how many bridges? (formula in terms of N):