Compute the minimum cost spanning tree for the undirected graph given below using Prim's Algorithm. The vertices are V = {A, B, C, D, E, F) and the edges are given in the form of a cost matrix. S vertex {A} A B C D E F A 0 5 10 7 3 6 5 V-S 0 4 5 8 9 C (B, C, D, E, F) 10 4 0 1 7 4 DE F X 7 5 1 8 3 3 80 08 7 0 7 6 Complete the table shown below to trace the actions of Prim's Algorithm where S is the set of vertices that are currently part of the spanning tree, V-S are the vertices not in the spanning tree, x is the vertex selected for addition to the spanning tree, and T is the set of edges that define the spanning tree. 9 4 3 7 0 T empty