1. Fill up the following blanks to simulate a left-most derivation of bbc for the grammar (7 points) 2. Given the C-F grammar S AB A aA | B bB | A, transform it into an empty- (5 stack PDA by constructing the remaining PDA instructions in the following blanks. points) (0, a, a, pop, 0) (0, b, b, pop, 0)