1. Write DFA, NFA (small), regular expression and right linear grammar for strings over {a,b}

a. End in either aa or bb

b. ( aⁿ | bⁿa) n >= 0

c. {w : w such that w contains the substring bb or w contains an odd number of as (or both).

d. {w : w does not contain exactly two as}

e. { w : w starts with substring abb and contains substring bba}