I need help with this assigment

1) Left linear grammar is given as SS10 | S11 BE a) b) Convert this grammar to right linear grammar Find a corresponding Finite state machine of the right linear grammar that you have found in a) 2) Generate Parse tree for the following Context Free Grammar A- aaBb 3) Find CFG for Find context-free grammars for language L a" bm: 2n sms 3n) 4) For the following CFG SABaaaB a) Is it ambiguous or not? Prove it. b) f it is ambiguous, make it unambiguous. 5) Give the derivation tree for expression (ab)c ab, using the following grammar with non- terminals set (E, T, F, I), and terminals set fa, b, C, +, *0)), E-T E- E+T