Problem 5. (20 points) A regular grammar is a grammar G (V.T.S, P) in which production rules are of the form A ma or A - aB, where a E T and A, BEV. The rule S A is allowed, where S is the start variable. Regular grammars generate regular languages. Give a regular grammar for the following regular lan- guages: L1 L(a'b" + (a +b)(a + b) L2 -(w E (a, b: w3k, for some k 20 )