State which of the following languages are (1) not context-free (2) context-free but not regular or (3) regular and context-free. If a language is not context-free then give a string, s, for that language that could be used in a proof using the Pumping Lemma for context-free languages b. B={(ab)n(cb)m 1 m, n > 0 and m ,t n} E = (w I w is in {a, b, cr and w has an equal number of abbcac is in E. e. a's, b's and c's). So Please solve it step by step and clearly Thank you