Several languages are described below. For each language, determine whether it is A. Regular B. Context-free but not regula Turing decidable but not context-free D. Turing recognizable but not Turing decidable E. Not Turing recognizable 5. RTM-kNw N is a Turing machine, w . and N rejects w) As in the textbook, cN,wo is a string that encodes the Turing Machine N and input string w.) As usual, x" denotes a string of n copies of x. For example, 1'denotes the string 111 (Here, binary/(n) denotes the binary representation of n. For example, binary(9)-1001) se 10,1)1 the number of O's in s is a multiple of S and the number of 1's is not a multiple of S -10. Ema (M> 1 M is a Turing Machine and M accepts no strings) As in the textbook, is a string that encodes the Turing Machine M) (HINT: Consider the complement of this language. How could one use an enumerator for . to create a recognizer for this language? Why is this significant?)