X- Using L from the previous problem, is L2 ? Circle the appropriate answer and justify your answer. YES or NO Consider the language: L5 = { < M > M is a Turing machine that halts when started on an empty tape} Is L5 Eo? Circle the appropriate answer and justify your answer. YES or NO 2- For the 7 sets of languages we have examined (FIN, ALL, REG, CFL, 0, Eo, E), list each set in the proper sequence with the C symbol between each adjacent pair. You answer should be of the form: ACBCCCDCECFCG