Let L $=\{$ an bm: n $>=1,$ m$>=1\}\{$ bm an: m $>=1,$ n$>=1\}$

a$)$ Create an NFA that accepts L$.$ Create and test your NFA on JFLAP. Copy the NFA

diagram into Homework #$3.$

b$)$ Test your DFA diagram with the following strings:

aaabb, bbbaa, aab,,bbba, ababba, ab $,$ bbbba, bbbaab, aaabbbbbaa

Copy the JFLAP test diagram for your NFA to Homework #$3$

Requirement: This is a union machine. Use transitions to jump to each part of the

language.