a. Use Prim's Algorithm to find a minimum spanning tree for graph below, starting at vertex a, using alphabetic order to decide which vertex to chose in case of a tie. List the edges of the tree and a minimum of three passes of the algorithm in the Supporting Work file. b. What is the weight of the minimum spanning tree generated? Write this number in the blank below (just the number, no other writing)