Let $=\{a,b\}.$ How many different languages are recognized by NFAs with no $$ transitions

having exactly two states? List them. You might find it helpful to write a program to

generate all of the NFAs. For NFAs, if neither state is final the language is still empty, but

if both states are final the language need not be ${}^{***}.$