there are four questions about PYTHON

1.Consider the recursive function to generate the Fibonacci sequence in our handout, compute rabbit(3) by drawing a recursion call tree showing all of the computation required, and then use your call tree to compute the output.

2.Consider the recursive function to generate the Factorial of n in our handout, compute fact(3) by drawing a recursion box trace showing all of the computation required, and then use your box trace to compute the output.

3.Consider the list [11, 2, 18, 45, 44, 59, 70], sort the list in ascending order of magnitude and then perform a box trace of the method call: binary_search(list, 0, 6, 11)

4.In the hash table below of size 11 with the hash function h(key) = key % 11, if the linear probing technique is used to resolve the collisions, what does the hash table look like after the following insertions occur: 62, 64, 70, 22, 44, 47, 38 in the given order into an empty table? Include a brief explanation of the steps.