I need to solve c extra credit

Prim's algorithm for finding minimum spanning tree. a. Run Prim's algorithm on the graph below. For simplicity we use a distance array rather than a priority queue. Label each tree edge by the order in which it was selected. Use the table below to show the contents in the two arrays D (for distance) and P (for parent vertex) after each update. Please start vertex h. b. If the edges of the graph remain the same, but all the edge weights are increased by the same constant value, do you have to re-run the Prim's algorithm to find a minimum spanning tree? c. If the edges of the graph remain the same, but all the edge weights are multiplied by the same constant factor, do you have to re-run the Prim's algorithm to find a minimum spanning tree