$3(24$ pts$)$ Perform a dfs$($pre$/$post$)$ on the directed graph $G=(V,E)$ starting at vertex A; use the

ordering given in the adjacency list representing $E.$

$V=\{A,B,C,D,E,F,x,Y\}$

$E\{A\}=[B,D]$

$E\{B\}=[C]$

$E\{C\}=[A,D,F,x,Y]$

$E\{D\}=[]$

$E\{E\}=[A,F]$

$E\{F\}=[D,E]$

$E\{x\}=[C,Y]$

$E\{Y\}=[F]$

Draw a spanning tree $($horizontally$)$ consisting of the tree edges$($red$),$ Add pre$/$post numbers

and any back edges $($black$).$