Construct Non-Deterministic Finite Automata for the followinglanguage
1. w| w contains at least two 0’s, or contains exactly two 1s
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 00and the substring 11
5. The set of strings over alphabet {0, 1, …., 9} such that thefinal digit has not appeared before.
Expert Answer
An answer will be send to you shortly. . . . .