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) {w|w contains an even number of 0s, or contains exactly two 1s, along with any number of 0s.} with six states.

(b) {w|w contains zero or more 0s, followed by zero or more 1s, followed by one or more 0s} with three states.

(c) The language {} with one state.