Generate the DFS tree for the given graph.
Generate the DFS (Depth First Search) Tree for the given grap From the tree, answer the following two questions: 1. Enter all the back edges. For example, you would enter/type: AB, BC, CD, etc. 2. Enter the push and pop ordering of the vertices. For example, you would enter/type: push order: \( \mathrm{A}, \mathrm{X}, \mathrm{F}, \mathrm{Z}, \ldots \), etc. pop order: B, Y, P, D, ..., etc. Start from vertex ' \( d \) ' and resolve ties in alphabetical order.