automata and computability

* PLEASE DO DRAW THESE NFA's

1. Construct a NFA which recognize the language L={w{0,1}:w contains both "000" and "111" as a substring 2. Construct a NFA which recognize the language L={w{0,1} : w contains at least two 0s or exactly two 1 s 3. Construct a NFAs for for the languages L={w : w does not start with a Punctuation or contains only Alphabets } where = D U A U P Digit, D={0,1,2,3,4,5,6,7,8,9} Alphabet, A={a,b,c,.,x,y,z} Punctuation, P={;} You can use the sets above to label the transitions of your NFA