Assume that Prim and Kruskal have come together to design a new algorithm to find the minimum spanning tree where the edges are picked alternatively first using the Prim's approach and the second using the Kruskal's method. Write briefly the pseudo code of the algorithm, analyze its complexity and explain the MST found in the below graph using this approach. 1 A B 5 7 8 10 (Fig. 6) 9 11 E 3 D