Consider the weighted graph below. G 5 H 1 3 6 th 5 5 00 6 D F 00 8 2 6 3 8 5 5 A 2 B C Find a minimum spanning tree by applying (a) Kruskal's algorithm (b) Prim's algorithm (starting from vertex A) (c) Cutting-down algorithm. (When keying in edge name, please follow the alphabetical order, e.g. AB instead of BA.)? (a) In the execution of Kruskal's algorithm, What is the third edge added to the spanning tree? What is the weight of the sixth edge added to the spanning tree? (b) In the execution of Prim's algorithm (starting from vertex A), What is the third edge added to the spanning tree? What is the weight of the fifth edge added to the spanning tree? What is the weight of the fifth edge removed from the graph? What is the last edge removed from the graph? What is the weight of a minimum spanning tree? How many minimum spanning trees are there