Give state diagrams of NFAs with the specified number of

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 {w| w ends with 00} with three states

b. The language of Exercise 1.6c with five states

c. The language of Exercise 1.6l 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 {ε} with one state

h. The language 0^* with one state

Exercise 1.6c

c. {w| w contains the substring 0101 (i.e., w = x0101y for some x and y)}

Exercise 1.6l

i. {w| every odd position of w is a 1}