Let A be an infinite recursive set, and for each n, let a(n) be the nth element of A in increasing order (counting the least element as the 0th). Show that the function a is recursive.(Hint: Consider the auxliliary function g(n)=the least element of A that is >n.)
