1. Find (as simple as possible) an unambiguous regular grammar which generates the following language over A (a,bj: = {" l num(a, x) is even /\ each b is followed by at least one a} where num(a, z) denotes the number of occurrences of symbol a in the string a. Illustrate your grammar by a derivation of a nontrivial string