Which of the following statements is true? Every problem can be solved with an algorithm for all possible inputs, in a reasonable amount of time, using a modern computer. A Every problem can be solved with an algorithm for all possible inputs, but some will take more than 100 years, even with the fastest possible computer. B Every problem can be solved with an algorithm for all possible inputs, but some of these algorithms have not been discovered yet. There exist problems that no algorithm will ever be able to solve for all possible inputs. D

Create an algorithm to discover a number that is not in a set of n real numbers given a set of n real numbers. Demonstrate that your method is optimum by giving a lower limit on the number of steps needed to solve the issue that is based on information theoretic principles.

5. Construct a Turing machine for the function f(n) = 2n, with n a positive number in unarynotation.

Limurians live on the planet Lemuria where the passage of time is measured in lims (days), limhas (weeks),limahas (months) and limaals (years), where each limha (week) has 5 lims (days), and each limaha (month) has3 limhas (weeks) and each limaal (year) has 10 limahas (months).Given the name of a Limurian and the number of lims (days) the Limurian has lived on the planet, write aPython program to compute and print the Limurian’s age in limaals (years), limahas (months), limas (weeks)and lims (days).Call the file containing your program limurian_age.py.Sample input (shown in bold blue) and output from the program is as follows:Please enter Limurian's name: LimardPlease enter the number of lims that the Limurian has lived for: 3547Limurian Limard is 23 limaal(s), 6 limaha(s), 1 limha(s), and 2 lim(s)old.