Find grammars (i.e., you should list the variables and all production rules) for the following two languages:

a. L1 = Set of all strings on {0,1} that consist of a 0 followed by an odd number of 1s (25 points)

b. L2={w{a}*:|w|mod3=0}