2.Construct DFA's equivalent to the NFA's: (8 pts) ({p, q, r, s}, {0,1}, 8, p, {s}) ove is the set of states, the alphabet, the transition function, the initial state, the final state) 8: p. S 3. Which of the following languages are regular sets? Either you answer Yes or No for each question, prove your answer. (18 pts) a) {0" 10" | nm are natural numbers (n, m>0)} b) {02nn >=1} c) {0mlnm are natural numbers (n, m>=0) and m is not the same as n} d)The set of all strings that do not have three consecutive O's. e)The set of all strings with an equal number of O's ad l's. f){x|x in (0+1)', and x = xR} xis x written backward; for example (100) = (001)