A given weight, connected, undirected graph is following, please choose the correct paths, from Minimal-cost spanning tree generated from the given graph. (Multiple choices) Connected, Weighted, Undirected Graph 5 10 3 0 5 6 1 1 4 7 ro 2 3 5 單選或多選: O a. There is one path [2->3->4->1->0->5] on the Minimal-cost spanning tree of given graph. ☐ b. There is one path [1->0->5->4] on the Minimal-cost spanning tree of given graph. c. There is one path [2->3->4->6->1->0->5] on the Minimal-cost spanning tree of given graph. ☐d. There is one path [2->6->4->5] on the Minimal-cost spanning tree of given graph. ☐ e. There is one path [2->3->4->6] on the Minimal-cost spanning tree of given graph. ☐ f. There is one path [5->4->6->2->3] on the Minimal-cost spanning tree of given graph. Og. There is one path [0->1->4->6] on the Minimal-cost spanning tree of given graph. Oh. There is one path [3->2->6->4->5] on the Minimal-cost spanning tree of given graph. Oi. There is one path [0->5->4->1->6->2] on the Minimal-cost spanning tree of given graph. ☐ j. There is one path [0->1->6->2] on the Minimal-cost spanning tree of given graph. ☐ k. There is one path [3->2->6->4] on the Minimal-cost spanning tree of given graph. O I. There is one path [5->0->1->4] on the Minimal-cost spanning tree of given graph. Om. There is one path [1->4->3->2] on the Minimal-cost spanning tree of given graph.