Problem 2. (25%) For given z), say, x) = 1.0, write a program to compute the sequence (1), 7(2), 2(3), ..., 2(N), up to a suitably large value of N, e.g., N = 20, or higher where necessary, using the recurrence relation (k+1) = f(x()); k=0,1,2,3,..., where f(x) = 2 Plot the results on the graph in terms of N values. 32 Problem 2. (25%) For given z), say, x) = 1.0, write a program to compute the sequence (1), 7(2), 2(3), ..., 2(N), up to a suitably large value of N, e.g., N = 20, or higher where necessary, using the recurrence relation (k+1) = f(x()); k=0,1,2,3,..., where f(x) = 2 Plot the results on the graph in terms of N values. 32