ANSWER #9 7. [20%] Prove that the following language is undecidable la {?M) | M is a TM and L(M) is finite }. 8. [20%] Prove that the following language is undecidable ?3 = {?M) | M is a TM and L(M) = L(0.1.)) where L(0'1") denotes the language of the regular expression 0' 9. [Bonus, 25%) Is the complement of La is Turing recognizable? Is the complement of L3 is Turing recognizable? Prove your claim