Last picture is the answer, please draw spanning tree and explain how, thank youuuu

3. Is the graph with the adjacency matrix on the right connected? Test by trying to build a spanning tree found by a depth-first search starting at a. a bcdef_g a 0 0 1 0 01 1 b00 1 0 0 0 0 c1 1 00 0 0 1 d0 0 0 0 0 0 1 e 0 0 0 0 0 1 0 f1 0 0 0 1 0 0 g 1 0110 0 0 a-c-b (back) c-g-d (back, back, back) a-f-e