please do number 2 only.

. Computability What do 1) Argue that the set of computer programs in any language must be at most countably infinite. I we know about computer programs? Argue that for a given programming language, most real numbers cannot be computed as the (potentially infinite) output of any program. 2 3) Different programming languages have different abilities. Is it possible that between ProgrammingLan- guage 1 and ProgrammingLanguage 2, they could, taken together, compute all real numbers? Why or why not. help us compute more things if it were? by any computer program. What do you need to show in order to prove this? 4) Is it possible that the set of programming languages is uncountably infinite? Why or why not. Would it 5) Argue that there are functions from the natural mumbers to the natural numbers that are uncomputable