2. For the graph G below, create the dept?h first search forest that starts with node A. Whenever there is a choice of which node to visit next, choose the node that comes alphabetically first. Use solid arrows for tree edges. Add all "missing edges" as dashed edges. Label all edges as tree, forward, backward, or cross edges. Add postorder numbers as subscripts to each node name. 2. For the graph G below, create the dept?h first search forest that starts with node A. Whenever there is a choice of which node to visit next, choose the node that comes alphabetically first. Use solid arrows for tree edges. Add all "missing edges" as dashed edges. Label all edges as tree, forward, backward, or cross edges. Add postorder numbers as subscripts to each node name