4. (TBD pts.) Running DFS Run DFS on the graph above but assume that vertices are visited in REVERSE alphabetical order (e.g. given a choice between nodes D and F, visit F first). (a) List the nodes in the order you visit them (so each node should appear in the ordering exactly once). (b) List each node with its pre- and post-number. The numbering starts from 1 and ends at 18. (c) List all the edges and for each edge specify whether it is Tree, Back, Forward or Cross