(10) "Mark" each node as Depth First Search would find each node in the following graph. Label each edge as (re)starting DFS and also for visiting edges (start at "a" and visit adjacent nodes that are alphabetically before others as you expand each tree). (5) And give the topological sort, if one exists (if none, state why): tree, cross, forward, or back. Assume each item is visited in alphabetic order for both