Problem \#1: Give a state diagram of NFA without null transition with specified states of the following languages: 1. L1={w{0,1}w ends with 00} with three states 2. L2={w{0,1}w contains substring 0101 i.e.w =x0101y} with five states states 3. The set of strings over an alphabet {0,1,,9} such that the final digit has appeared before. 4. The set of strings over an alphabet {0,1,,9} such that the final digit has not appeared before. 5. The language contains set of words with 0 or more occurrences of ab followed by a or aa or aaa. Problem \#2: Give a state diagram of NFA with null transition with specified states of the following languages: 6. L3={w{0,1}w ends with 00 or ends 11} with five states 7. L4={w{0,1}w contains substring 00 or substring 11} with five states states