Finding a grammar for the language L fw E {a, na WE nb(w) can be done in two steps (1) find an empty-stack PDA that accepts L, (2) transform the PDA into a C-F grammar. The following empty-stack PDA accepts L. (21 points) a, X a, a a, b push (a) push(a) pop A, X start pop b, X b, b b, a push(b) push(b) pop So, to find a grammar for L, we need to transform this PDA into a C-F grammar. In the following, we list the PDA instructions on the left and you put the corresponding grammar productions in the blanks on the right. We start with Type 4 first Type 4: The start state and the PDA instruction Ax/pop as shown below gives A, X pop 01 start Type 1: The PDA instruction AX/pop by itself as shown below gives: (1 point) A, X pop Finding a grammar for the language L fw E {a, na WE nb(w) can be done in two steps (1) find an empty-stack PDA that accepts L, (2) transform the PDA into a C-F grammar. The following empty-stack PDA accepts L. (21 points) a, X a, a a, b push (a) push(a) pop A, X start pop b, X b, b b, a push(b) push(b) pop So, to find a grammar for L, we need to transform this PDA into a C-F grammar. In the following, we list the PDA instructions on the left and you put the corresponding grammar productions in the blanks on the right. We start with Type 4 first Type 4: The start state and the PDA instruction Ax/pop as shown below gives A, X pop 01 start Type 1: The PDA instruction AX/pop by itself as shown below gives: (1 point) A, X pop