Draw the simplest possible (i.e. with fewest number of states) NFA that accepts the following language over the alphabet {A,E,i,o,u,M,N,P,t,r}: the set of all strings that start with an upper case letter, then one or more lower case letters, then an upper case letter, and after reading any sequence of zero or more vowels from the alphabet, eventually ends with the same lower case letter that preceded the second upper case letter. (Hint: remember that in DFAs all information that needs to be stored will be encoded in the structure of the DFA itself, i.e. in the path taken).