$10$ 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.

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

$*$Algorithm for finding a:

$2)$ How many bridges will you end up with if you used this algorithm?

$*$Give the Formula and the number where N $=10$: $=$