automata theory

Given Sigma = {a, b}, write a regular definition for the following language: L(w) = {w | w ends in and contains the substring Given Sigma = {10, 1}, describe in English the languages denoted by the following regular expression: (0 + 1)*101 (0 + 1)* Given Sigma = {a, b, c}, write a regular expression for the set: "All strings of a's and b's and c's containing exactly two a's" Given Sigma ={a, b}, write a regular expression for the set: "All strings of a's and b's beginning with bb and not having three consecutive a's" Given Sigma = {0, 1}, describe in English the languages denoted by the following regular expression: (0+1)*(00+01+11) + lambda + 0 + 1