dont have to provide the jflap i can do that myself
Provide the state diagrams of NFAs (with the specified number of states) recognizing each of the following languages. In all parts, sigma = {0, 1}: (a) The language {w | w has length of at most one} with two states (b) The language {epsilon} with one state (c) The language {w | w does not contain 0} with one state (d) The language {w | w starts with 0 and every 0 is followed by at least one 1} with three states