a$)$Give the DFS postorder traversal of the digraph

b$)$ Give the DFS preorder traversal of the digraph

c$)$topological sort $($topsort$)$ that the textbook's algorithm constructs.

d$)$ After we run BFS $(G,5),$ with a starting node $0,$ what values are in the distTo$[]$ arrays?