Solve parts a, b, and c for question 1.

A. Moving to another question wal nave this response. Question 1 of 14 Question 1 10 points Question Completion status: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ln=A and=A 6 Q1 b) (5 marks) Find the minimum spanning tree (MST) of the graph using Kruskal algorithm by entering Y or N in the box after each edge in the table below. What is the total weight of the minimum spanning tree? \begin{tabular}{|c|c|c|c|} \hline nin & Tinet & & \\ \hline AC & 13 & 4 & \\ \hline pe & 8 & 5 & \\ \hline or & 4 & e & \\ \hline sr & 1 & 1 & \\ \hline in & 1 & 18 & \\ \hline 10 & 4 & 0 & \\ \hline F & 4 & 4 & \\ \hline & , & 1. & \\ \hline \end{tabular} 14