Consider the following weighted graph, represented by its adjacency matrix, where

x₁ = 1 , x₂ = 4, x₃ = 2, x₄ = 0, x₅ = 8, x₆ = 0, x₇ = 4

f g a T3 to z3 10 10 T6 T1 T2 T6 (a) List the edges of the minimum spanning tree in the order they are added by Kruskal's algorithm. (b) List the edges of the minimum spanning tree in the order they are added by Prim's algorithm starting from vertex a