1. Write regular expressions and draw NFA for the following languages over the alphabet Σ = {a, b}:
a. All strings that do not end with aa.
b. All strings that contain an even number of b’s
c. All strings that contain atleast two a’s or exactly two b’s
d. All strings that ends with double letters (aa or bb)
e. All strings that does not ends with double letter.(can end with ab or ba)
