Consider the following array:

	1	2	3	4	5	6
1	0		72	50	90	35
2		0	71	70	73	75
3	72	71	0		77	90
4	50	70		0	60	40
5	90	73	77	60	0	80
6	35	75	90	40	80	0

a.) Starting with vertex v4, trace through Prim's algorithm to find a minimum spanning tree for the graph represented by the array shown here.

b.) Show the set of edges that comprise the minimum spanning tree.

c.) What is the cost of the minimum spanning tree?