Construct a PDA that recognizes the following language: You are given the CFG G = ({S, T, F, N}, {0, 1, +, *, (, }}, R, S) with these rules R. S->S+TTT->TF|FF-> ()NN-> ON 1N|0|1 Follow the CFG to PDA procedure to produce a PDA recognizing L(G). Hint: To get the maximum number of points, use as few states and nonterminals as possible! Alphabet: {0, 1, +, *, ()} Stack alphabet (the first symbol is the initial one): {$, S, T, F, N, 0, 1, +, * (.)} Acceptance final state AND empty => final state and empty stack need not be reached at once for a condition: stack word! Deterministic (DPDA): false Construct a PDA that recognizes the following language: You are given the CFG G = ({S, T, F, N}, {0, 1, +, *, (, }}, R, S) with these rules R. S->S+TTT->TF|FF-> ()NN-> ON 1N|0|1 Follow the CFG to PDA procedure to produce a PDA recognizing L(G). Hint: To get the maximum number of points, use as few states and nonterminals as possible! Alphabet: {0, 1, +, *, ()} Stack alphabet (the first symbol is the initial one): {$, S, T, F, N, 0, 1, +, * (.)} Acceptance final state AND empty => final state and empty stack need not be reached at once for a condition: stack word! Deterministic (DPDA): false