Question 5: We are given a DFS tree. Direct the tree edges away from the root. Show that each vertex has a directed path to the root that uses at most one backward edge, if and only if all the leaves have an edge to the root. Remark: The direction given to Tree edges imply that you can only go down the tree with tree edges. Note that backward edges are not directed and thus you can be used in on both directions