Classify the following languages as either A. regular, B. context free but not regular, C. recursive but not context free, or D. not recursive, and explain for each why you chose that answer. You do not have to give detailed proofsjust give one or two sentences that outline how you would prove your classifi cation. a. {m#x | m encodes a TM and x is a string it accepts} b. {anbncn} c. {x {a, b}* | the number of as in x is the same as the number of bs in x} d. {anb2n} e. {p | p is a recognition method that is syntactically legal (that is, it can be parsed using a standard grammar for Java)} f. the set of strings that contain the Java statement while(true){} g. {(p, x) | p is a recognition method that, when run on the input x, executes the statement while(true){}} h. {p | p is a recognition method and L(p) {}} i. {m | m encodes a TM M with L(M) {}} j. {xx | x {a, b, c }* } k. {(m, x) | m encodes a TM M that, when run on the input x, visits a state q7} l. L(a*b*) L((a + ba*b)*) m. {xxR | x {0, 1}*}