2. The language generated by the following C-F grammar SCBACcCBbBAaA is {cmbnapm,n,pN} (note that m,n and p could be zero, so is an element of this language). To transform the above C-F grammar to a one-state empty-stack PDA so that the accepted language of the PDA is the same as the language generated by this C-F grammar, we need to construct a set of specific instructions for this PDA. Three instructions have already been constructed below. Construct the remaining instructions for this PDA in the following blanks. You might not need all the provided blanks. (7 points)