Target : Get a subset of edges such that weight is minimum and it connects all vertices.
Since, all weights are positive and we need a subset with minimum weight, then we should avoid cycles, coz we should have only a single path between any pair of vertices in the graph. Having a cycle will unnecessarily add up edge weight and will do no help in accomplishing the target.
This rules out all options A, B and C.
Hence, answer = option D