i. list the vertices in the order they are visited in a depth first search that starts at vertex b. (assume that dfs processes vertices alphabetically, when given the option of multiple vertices to explore.) draw the spanning tree resulting from dfs.
