2. Answer each of the questions below. Each question is worth 10 marks; {20 marks} {a} Using Kruskal's method, find a minimum spanning tree of graph A on the previous page. {b} Using Prim's method, find a minimum spanning tree of graph A on the previous page. 1. Answer each of the questions below. Each question is worth 10 marks; {20 marks} [ai Use Dijkstra's algorithm to find all shortest paths starting from vertex 1 in graph A above. [hi Find a breadth-tirst-searoh spanning tree of graph A above, starting from vertex 1. Describe all the steps of the search and draw the final tree