For the Grammar:

E -> E E P

P -> +

P -> -

P -> *

P -> /

E -> i

1a.) Compute the FIRST and FOLLOW sets for the nonterminal symbols, and use them to build the CFSM(Characteristic Finite State Machine) and parse table for SLR(1) parsing.

1b.) Show that ii+ii*- belongs to the language generated by the grammar by drawing a parse tree.

1c.) What kind of arithmetic/algebraic expressions are generated by this grammar? Your choices are prefix, infix, or postfix.