solve the following discrete math question

Question 7. 8 points Consider the following complete graph Page 3 (a) (1 point) Find the total number of (labelled) spanning trees, leave the result in exponential form. (h) (? nointe) Find a Minimum-woioht Snannino Tree (MST) nsino Kruckal's Alonrithm (c) (2 points) Perform the Tree Shortcut Algorithm and find an approximate solution to the TSP on this graph. (d) (3 points) Give numerical bounds, both upper and lower, on the optimal solution to the TSP. Explain briefly