For = {a, b}, construct two NFAs one that accept the language A and one that accepts B. (Notes, since every DFA is also a NFA, you can make a DFA if you want.)

A) A = { w | w is in ^* and w has an odd number of as}

B) B = { w | w is in ^* and w ends in ab}

C) Construct a NFA (use ) for the language L = { w | w is in A or w is in B}