3. Let 2-[a,bj. For each part below, give the formal definition and state diagram fora nondeterministic finite automaton (NFA) that accepts the specified language. 24 points a) L-w the symbol at the fourth position from the end is the same as the last symbol b) L wcontains the substrings abb or bb;, and using only 4 states. c) L,-e, a, aa } , and using only 3 states, of which only 2 may be accept states