Please answer ALL parts and indicate the answer to each part clearly. Thank you

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 {0} with two states b. The language 0* 1o* with three states c. {wl w contains an even number of Os, or contains exactly two 1s} d. The language {f} with one state e. The language 0* with one state