Express the following set as a regular expression: The set of all strings of length at least three over {0,1} such that every three consecutive symbols contain at least two 1's. Also show that if A is a regular language, then so is {w|ww^R belongs to A?