You are building a spanning tree with a depth-first search (DFS)using alphabetical order to break ties. Use a as your root. On the test show your understanding of DFS by drawing a few pics, tracing the edges and breaking ties in a proper (required) order! Your answers should be comma separated lists in alphabetical order. In your spanning tree, a) The leaves are b) The children of a are c) The children of b are d) The children of d are e) The children of e are f) The children of f are g) The children of g are h) The children of h are