1. Consider the following graph: A 8 5 B 2 1 6 10 F (a) Use Kruskal's algorithm to compute the MST. It will suffice to indicate the order in which edges are added to the MST. (b) Now use Prim's algorithm starting at node A to compute the MST, again by indicating the order in which edges are added to the MST. (c) Is it possible to change the starting node for Prim's algorithm such that it adds edges to the MST in the same order as Kruskal's algorithm? If so, which starting node(s) would work? Justify your answer. Note: For parts (a) and (b), let (Nodel, Node2) represent the edge between two nodes Nodel and Node2. Therefore, your answer should have the form: (Nodel, Node2), (Node4, Node5), etc