Let A be a c.e. set of natural numbers. Show that there exists a computable binary relation RA on N such that A={xN:y,RA(x,y)} Notice that Q4 is asking you to prove the converse implication of Q1. Hint: Consider the number of steps a Turing machine takes while running a particular computation