4 4 2 5 2 0 Represent this weighted-graph as an adjacency matrix. Write code which can find 2 distinct spanning trees in this graph. Print these trees and their total weight of these trees. . Write code to implement Prim’s algorithm for finding the minimum spanning tree (MST). Print the minimum spanning tree and its weight. Show transcribed image text 4 4 2 5 2 0 Represent this weighted-graph as an adjacency
OR
OR