CSCI 311/500 Models of Computation Homework #5 Hand in hard copy or upload typed solutions to blackboard by 4pm on Priday, November 9th. No photos, plense. 1. Consider the following, grammar: (a) Show a derivation tre for the string aabbbb using the grammar. (b) Give an English description of the Iauguage generated by the grammar. 2. Let G be the grammar below S ASB | ab | SS (a )Show that G is anbighons (b) Construct an umambiguous grammar sxuivalent to G 3. Find a context fro grannnar for the language L3 # ('bnc" +m : n, m 21 4. Find a context free graminar for the language L1 = {a"be": 0, k > 3)