Qtext: For the below Graph (fig-1), you will find the maximum spanning tree. Fig-1 a. Using prim's algorithrn starting with vertex A. A. list the vertices of the graph below in the order they are added to the maximum spanning tree. [2.5M] b Using Kruskal's algorithm, list the edge of the Maximum spanning tree of the graph (fig-1) in order that they are added