3.1 Which of the following languages are regular sets? Prove your answer. b) (01'o"|m 2 1 and n 2 1] c) o n is a prime) 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 0's and l's. f) {xlx in (0 + 1)*, and x = x xR ls x written backward; for example, (011)"-110. g) {xwx*|x, w in (01)*)