For the graph given below: 8 B D 7 6 5 A 3 F 2 8 8 E 3 (a) Give the breadth first traversal steps of the graph with starting graph node as A. (b) Give the depth first traversal steps of the graph with starting graph node as A. (c) Construct the minimum spanning tree using Kruskal Algorithm and also compute the total weight of the spanning tree. Show the spanning tree construction steps