Construct a PDA simulating leftmost derivation of the following CFG G:

S aAC S bB A dSb

A B SbB

Bb C aCC

Cb

Construct the LL(1) parse table for the above grammar containing FIRST,FOLLOW, and LOOKAHEAD sets.

Construct the LL(2) parse table for the above grammar containing FIRST, FOLLOW, and LOOKAHEAD sets.

Run the LL(2) parser on the input string adbbbabb to find an accepting computation. Use nondeterminism if the grammar is not LL(2).