Draw the recursion tree for the function merge sort 11 18 2 17 8 3 5 1

Create a recursion tree for T(n)=3T(n/2)+2n^2, with T(1)=c2, for n=8 . calculates the total number of comparisons.

Solve using the recursion tree T(n) = 4T(n-1) + c, where c is a positive constant, and T(0)=0.

Draw the tree corresponding to the recursive calls to evaluate the followingprefix expression:+ * 2 + / 14 2 5 1

(OCaml) Define a recursive function pos: int list -> bool that returns true if allelements of the list are greater than zero, false otherwise. [Hint: and operation isdefined as & in OCaml]# pos [1; 2; -1];;b) : false# pos [1; 2];;c) : true

Sort the array {3,17,38,2,43,19,25,40} using Merge Sort, also showing the recursiontree.

Write the recurrence relation for the recursive binary search algorithm and explain it. Express that using Big-O notation. Show all your work.

Given below is a recursive function fib for computing the nth fibonacci number. Draw the recursive tree for computing fib(4) def fib(n):    if n <= 1:        return 1    else:        return fib(n - 1) + fib(n - 2)

Draw the recursion tree:

Write a recursive program to insert an element in the sorted array using stack in pyhton