Consider the graph shown on the right. The 12 edges in the figure are marked with letters a tol, and the numbers on the edges indicate the cost of the edges. Calculation Use Prim algorithm to calculate the minimum cost spanning tree; the node marked with * must be selected as the starting node. As a solution, only the alphabetical order in which the Prim algorithm selects the edges of the tree is given. 2(b) In order to effectively implement Prim and Kruskal algorithms, people need a basic data structure in each case. For each of these two algorithms, explain which data structure is needed, and explain in one or two sentences what information the algorithm stores in the data structure. 12 h 11 12 14 15 22 a b -18 -3 k 14