Consider the following graph. 2 7 6 C 10 10 H 11 E 12 15 14 (a). Find a minimum spanning tree of the graph using Kruskal's algorithm. List the edges in the order they are put into the tree. (b). Apply Prim's algorithm to the same graph starting with node A. List the edges, in order added to the MST. (e). Suppose the cost of every edge touching node A is increased by a constant. Are we guaranteed that the MST remains the MST? Explain.