1 For each of the following regular expressions, find a grammar that is not regular and represents the same language (even though the languages are regular): a. a+b b. a+bc a.
2. a. Find a regular expression to represent the set of all strings over the alphabet {a,b} that have an odd number of a 's.
b. Find a regular grammar to represent the set of all strings over the alphabet {a,b} that have an odd number of a′.s.