CA 1.7 Give state diagrams of NFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0,1}. Aa. The language {wl w ends with 00} with three states The language of Exercise 1.6c with five states The language of Exercise 1.61 with six states d. The language {0} with two states e. The language 0*1*0+ with three states Af. The language 1*(001+)* with three states g. The language {C} with one state h. The language 0* with one state