5) Give a rightmost derivation of the string (xta)*x using: S-> E The lexical analyzer returns a token i--identifier for variables 'x' and 'a' Display the parse tree, the syntax tree, and the expression DAG EXTRA credit: The algorithm for DOM in the text is based on data flow analysis, but it is often desirable to find the DOM tree from the control flow graph without the need to do data flow. Create an algorithm that finds the DOM tree based on breadh-first or depth-first search