Ch) For every three regular expressions R, S, and T, the languages denoted by (RUS).T and R.T US..T denote the same language True False G) EECS 4100 is fun. True False 2. (10%) Give a CFG that generates c.ub. that is,zero or many c, union zero or many b's Assume that the start symbol is S and nonterminals are uppercase letters 3. (8%) Finish the following statement of the pumping lemma. If A is a regular language, then there is a number p such that, if s is any string in A of length at least p, then 4. (10%) Suppose that a Turing machine M contains the transition ? (r, ) (p, c,L) where r and p are states, f and c are tape symbols. Assume the machine's tape currently contains aadft Determine the following: a) The current position of its read/write head, b) The position of its head after the transition, and c) The tape contents after the transition