Using part A and B, Construct a binary search tree from a sorted list

Problem 3: Constructing a Binary Search Tree from a Sorted List. (a) [10 points] Suppose you have elements with keys1.. , n. Write a recursive function insertAl(i, j) that inserts elements with keys ithrough j into a binary search tree so that the tree generated by insertAll(1,n) has height (gn (b) [5 points] Trace the execution of your function for the case where n 6, i.e., the initial call is insertAl(1, 6). Write down the sequence of recursive calls and draw what the tree looks like after each insertion