roblem 5: Minimum Cost Spanning Tree 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. 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