Answer the following DFT questions 1 to 4 for the given DAG and the DFT simulation. (DAG: Directed Acyclic Graph, DFT: Depth First Traversal. When visiting the children nodes follow L edge before R edge. PD(x) and LPD(x) are defined in the lecture note LN 14. The given DFT simulation has flaws.).