Which of the following languages are regular sets? Prove your answer.

3.1 Which of the following languages are regular sets? Prove your answer b) (01*0*m 2 1 and n 2 l) c) {O"In is a prime) d) the set of all strings that do not have three consecutive 0's e) the set of all strings with an equal number of O's and l's f) {xlx in (0 + 1)", and x = x xR Is x written backward; for example, (011)"-110. 8) fxwx* |x, w in (0 1)-) m+ n *h) {xx"?x, w in (0+1)*) t We say that g(n) is O(f(n) if there exist constants c and no such that g(n) s cf (n) for all n2 no