For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1,E2, and E3. ε is the empty string, \$$ indicates end of input, and, \mid$ separates alternate right hand sides of productions.
S→a A b B∣ b A a B∣εA→SB→S
SABaE1A→SB→SbE2A→SB→S$S→εerrorE3
The FIRST and FOLLOW sets for the non-terminals A and B are