[18 Points] Let L be a language over 22. = {0, 1, 2} where each 0 is followed by a 1 or (a) Give a regular grammar that generates L. (b) Convert the regular grammar into an NFA. (c) Give a regular expression for L.