DESCRIPTIVE / ASSIGNMENT QUESTIONS:1. Define String, Alphabet and Language.2. Prove that if d(q, x) =d(q, y), then d(q, xz) =d(q, yz) for all strings z in S+ .3. Construct DFA and NFA accepting the set of all strings with three consecutive0s.4. Find NFA which accepts the set of all strings over {0, 1} in which the number of occurances of 0 is divisible by 3 and the number of occurrences of 1 is divisible by 2.5. Differentiate NFA and DFA.6. Give NFA accepting the set of all strings of 0s and 1s such that the 10th symbol from the right is a 17. Give DFA accepting the set of all strings with 3 consecutive 0s over the input {0, 1}.8. Define Finite Automata. Give an example.9. Construct a NFA accepting ab, ba and use it to find a deterministic automation accepting the same set.