Item 1.

Find a subgraph with the smallest number of edges that is still connected and contains all the vertices.