We let = {a,b,c} be the alphabet we work with in this question. For each of the languages listed in the parts below, provide description in words or set notation of the language, if the question defines it by a regular expression and provide a regular expression if the question defines the language by a description in words or set notation. For each of the four languages also determine whether the language contains the empty word and give an example of one word over that is in the language and one such word that is not in the language. Recall that, for a word w, we let |w| denote the length of the word (that is, the number of symbols in w). (a) (ab) c(ab)+. (b) ++ abc (c) {w ||w| n},where n =10. (d) {w ||w| is divisible by m}, where m=9