Let A be a language. Define LA = {(M): A L(M)). This is the set of all Turing s a (a) Give with proof an example of a language AC2* such that LA is decidable. (b) Give with proof an example of a language A-D" such that LA is recognizable but undecidable. (c) Bonus: Show that there exists an A C 2* such that LA is unrecognizable. Give an example of such an A from Problem (c)