Need answer for part (a) (b) and (c)

Use Kruskal's algorithm to find a minimum spanning tree for the graph shown in Figure 2. Explain each step clearly. 4. (a) 7 Figure 2 (b) Is it true that both Kruskal and Prim's algorithms always find the same minimum spanning tree? Justify your answer. Consider an undirected and unweighted graph G. Two vertices are said to be within k hops of each other if the length of the shortest path between them is not more than k. Write an algorithm in pseudo-code to count the number of vertices in G which are within k hops of a given vertex v. Assume that G is represented by an adjacency list. (c)