I am unable to solve this problem, may have a solution to this problem please.

(3 points) Draw an NFA with three states using JFLAP for the language ( ab + abc)" -{a, b, c} After drawing it, you should test it with your own string with the size of more than 10. In the Menu, goto Input -> goto Step by state -> then put your own string of any a, b, or c. (e.g. w-ababcabcabcab) Show that at the end of your input the NFA went to a final state. Submit your screen shot hard copy from JFLAP