a.) Remove left factoring for the following grammar:

P cPQ | cP

Q dQ | d

b.) Remove left recursion for the following grammar:

S ABC

A Aa | Ad | b

B Bd | e

C Cc |g

c.) Construct parse trees for the strings given for the grammar below:

A A + B | B

B B x C | C

C (A) | a

(i) a (ii) a x a (iii) a + a + a (iv) ((a))