Give state diagrams of NFAs with the specified number of states recognizing each of the following languages. The alphabet is 10, 1). a. The language 0) with two states b. The language 0*1*0+ with three states c. The language 1 (001+) with three states d. The language {e, 0) with one state e. The language 0* with one state