please help me solve for question number 4 and number 5 both parts, thanks.

4. Cons?der the following weighted graph G. 6 2 7 7 For part a) illustrate the action of union and find for the collection of disjoints sets corresponding to the nodes in trees of the forest being grown as well as the forest itself An example will be done in class. For part b) illustrate the action of Prim's algorithm using Figure 6.11 on Page 272 as a model a) [10pts] Trace the action of procedure Kruskal for G. b) [10pts] Trace the action of procedure Prim for G, with r = 1. 5. For parts a) and b) illustrate the action of Dijkstra's algorithm using Figure 6.13 on Page 279 as a model a) [10pts) Trace the action of procedure Djkstra for the following digraph with initial vertex r=2. b) I10pts] repeat for r3