Here are some useful facts: 1) The set of all languages (over some nonempty alphabet) is uncountable. 2) The union of two countable sets is always countable, 3) The set of Turing machines is countable and 4) Every deciable language is decided by some TM. You now have everything you need to do the following problems quickly and easily Required:
Show that the class of decidable languages is countable.

Write a program that uses a two-dimensional array to store the highest and lowest temperatures for each month of the year. the program should output the average high, average low, and the highest and lowest temper- atures for the year. your program must consist of the following functions: a. function getdata: this function reads and stores data in the two- dimensional array. b. function averagehigh: this function calculates and returns the average high temperature for the year. c. function averagelow: this function calculates and returns the aver- age low temperature for the year. d. function indexhightemp: this function returns the index of the highest high temperature in the array. e. function indexlowtemp: this function retur