1) Python a) Find the exact solution for the recurrence relation an = 2a_n1 a_n2 with initial conditions a₀ =0 and a₁ =2.

b) Consider the following recursive Python function. Compute F(3).

 def F(n): if n == 1: 

 return 1 else: 

 return 2*F(n-1)+1 

c) Construct a binary tree for the values [17, 8, 14, 20, 18, 22, 10, 6, 5]. d) Write the Python implementation of the recurrence relation an = 2a_n1 a_n2 with initial

conditions a₀ = 0 and a₁ = 2. (15 Points) e) What is the recurrence relation and initial conditions that generate the sequence of integers

0, 1, 2, 8, 24, 80, ... ?