COMPUTER SCIENCE $-$ Please give sample C$++$ Code or Pseudocode a$)$ You have $n$ houses which you want to connect by fiber$-$optic cables. Your goal is to make sure

that there is a route $($possibly indirect, such as sending from house A to B then from B to C$).$ For

each pair of houses $i,j,$ you know the cost $c(i,j)$ for putting a cable between the two houses $($cables

allow two way traffic and $c(i,j)=c(j,i).$

You want a minimum cost collection of cables $($minimize the sum of the costs of the cables selected$)$

that allows routes between all the cities.