Just needs bce

Give state diagrams of NFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is 1o,1 1.7 Aa. The language (w w ends with 00) with three states b. The language of Exercise I c. The language of Exercise 1.6l with six states d. The language (0) with two states e. The language 0*1* with three states Af. The language 1 (001) with three states g. The language e) with one state h. The language 0* with one state Give state diagrams of NFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is 1o,1 1.7 Aa. The language (w w ends with 00) with three states b. The language of Exercise I c. The language of Exercise 1.6l with six states d. The language (0) with two states e. The language 0*1* with three states Af. The language 1 (001) with three states g. The language e) with one state h. The language 0* with one state