1. [20 points] Recall the following CFG from class, with variables representing expressions, terms, and factors. 10 points] Use the procedure from class to convert this CFG to a PDA. Do not simplify the resulting PDA. la. lb. 10 points Say what the contents of the stack will be each time the PDA visits the main loop state, for input (a+a)xa. (There should be only one accepting computation path, since the grammar is unambiguous.) Write the stack contents with the bottom of the stack on the right and the top of the stack on the left