Appreciate if you can answer this ONE QUESTION COMPLETELY especially PART (C) and give me a detailed working with explanation for me to understand. Once completed so long as my doubts are cleared and the solutions are correct, I will definitely vote up. Some of the question are similiar to take a look carefully before you answer as it's very important for me.

Thank you.

Question 6 16 pts Consider the weighted graph below 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, eg. AB instead of BA)? c) In the execution of Cutting-down algorithm, What is the weight of the fifth edge removed from the graph? What is the ninth edge removed from the graph? What is the weight of a minimum spanning tree? How many minimum spanning trees are there