(E)-ㄧㄧㄧ-F D) Figure 3: Graph for Problem 3. 3. Prim and Kruskal Executions (a) Execute Prim’s algorithm on the graph of Pigur 3 starting at vertex A. If there are any ties, the vertex with the lower letter comes first. List the edges in the order in which they are added to the tree. Show transcribed image text (E)-ㄧㄧㄧ-F D) Figure 3: Graph for Problem 3. 3. Prim and Kruskal Executions (a) Execute Prim’s algorithm on
OR
OR