Let A = {cid2k | 0 Sk Si} U {c" (dd)" | r> 2,5 > 2} The language A is denoted by the regular expression: c*(dd)* + c?c* d^(dd)* c* d* + c*(dd)* + d* (cc)* (cdd + ccdddd)* + dd + c?c* d(dd)* (c + d)*(dd)* (cd + cdd)* (dd)* + d* (cc)* None of the above