3] (10 pts) Apply the DFS traversal algorithm to this graph, starting at vertex S. Use alphabetical order to break ties. Show the stack after each PUCH and POP operation, keep track of both indices, as shown in class! Hints: - Note that some edges go both ways, but some do not. Traversal is possible only if there is an edge pointing in the right direction! - The graph has more than one connected component, so you will get a forest of trees! Write the final order of traversal here