Context-free langauges:

a.) The following language is regular over the alphabet {a, b}:

L = {w | w is not empty and if it contains any as, it has no bs.}

--> Prove that L is regular by finding a regular expression equivalent to L.

b.) The following language is regular over the alphabet {a, b}:

L = {w | w contains an odd number of as and exactly one b.}

--> Prove that L is regular by finding a regular expression equivalent to L.