Let A be the language consisting of all strings over {b,c} that have at least two times as many c's as b's. The language A is denoted by the regular expression: c(b+cc)c(c+bcc+bccc)(bc2+bc3+cc)(bcc)+(cbc)+(ccb)c(bcc)c+c(cbc)c+c(ccb)c None of the above