Solve the following optimization problem (that is, give an efficient algorithm that finds an optimal solution, and explains why it works): Given a graph G=(V,E), find the smallest set of new edges (on vertex set V) to be added to G so that it becomes a connected graph.
In this question, It is not clear form whether the graph G is connected or disconnected. I just tried by considering the graph G is disconnected and I didn't get the said efficient algorithm, any hint and help are appreciated.