Task on NFA Construction Section A

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}.

a. The language {w| w ends with 00}

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

c. {w| w begins with a 1 and ends with a 0}

d. {w| w begins with substring 1101}