1. In lecture we've discussed using Turing Machines as deciders for a language. Answer the following questions about Turing Machines, languages, and deciders. (a) In your own words, define the following terms and explain the relationship between them: alphabet, language, decider. (b) Formally define each language L stated in parts i through iii. Example: Only contains integers y divisible by 10. Answer: L = {y E Z: y mod 10 = 0} Only contains non-negative integers n which are perfect squares. ii. Only contains integers m which are even. iii. Only contains rational numbers x = which are reduced to lowest terms