Kruskal's algorithm Construct the minimum spanning tree by Kruskals algorithm on the following graph. You may use the table to facilitate your work. Choose the edges that will be included in the minimum spanning tree by Kruskals algorithm F 10 A 3 8 4 18 4 B 9 D 10 H 25 E || Kruskal's algorithm for MSTT Edge Cost Included in T (Y/N) (GD) |(E,F) (C,D) (F,C) 3 |(H,G) (B,C) 4 |(A,H) (B,F) (E,G) 7 (A,B) 8 (A,F) 10 (B,E) 10 (F,D) 18 I(D,E) 25 Tree Cost O (G,D) O (E,F) O (C,D) (FC) O (H,G) O (B,C) O (AH) O (B,F) O (EG) O (A,B) O (A,F) (BE) O (F,D) O (DE)