Theory of computation question . Classification: Computability (S22) Classify the following languages as below, and justify your answer: (RE) recursive enumerable (r.e.), (CO-RE) co-r.e. (i.e. the...

Extracted text: Theory of computation question . Classification: Computability (S22) Classify the following languages as below, and justify your answer: (RE) recursive enumerable (r.e.), (CO-RE) co-r.e. (i.e. the complement is r.e.), (BOTH) both r.e. and co-r.e., or (NEITHER) neither r.e. nor co-r.e. Note this means showing two things each: L is r.e. or not, and L is r.e. or not. а. L {M#x#y| M halts on x and loops on y} b. L= {M#x#y| M_accepts x and rejects y}