Construct Non-Deterministic Finite Automata for the following language

1. w| w contains at least two 0s, or contains exactly two 1 s

2. The language 0*1*0+ with three states

3. The language 1*(001+)* with three states

4. The set of strings over {0,1} which contain the substring 00 and the substring 11

5. The set of strings over alphabet {0, 1, ., 9} such that the final digit has not appeared before.