Problem 10. (10 points) Given x(0), say,(o) = 2.0, compute the sequence x(1), x(2), (3), . . ., 2 (N), up to a suitably large value of N, e.g., N = 10, using the recurrence relation (k+1)-f(z(k)), k=0.1,2, 3, . . . , where f(x) = Describe in a few words the observed behavior of the sequence. In particular, does the sequence approach a limiting value? If yes, then do you recognize what this limiting value is? Does the limiting value depend on r0)