Constructing an NFA Let E = {o, b} and consider the language L = a"bub* a) Give an NFA that recognizes L. Your NFA should have at most 4 states. b) Give a DFA that recognizes L. Your DFA should have at most 16 states