(3a): Given 2-fa, b), write a regular definition for the following language: L(w)-w w ends in aa and contains the substring aba) (3b): Given 2-(0, 1, describe in English the languages denoted by the following regular expression: (0+ 1) 10101)* (3c): Given -{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" 3d): Given 2- fa, 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" (3e): Given -0,1, describe in English the languages denoted by the following regular expression: (0+1*(00+01+11)++0+1