| Binary search trees have their best perfor- n mance when they are balanced, which means that at each node, n, the size of the left subtree of # is within one of the size of the right subtree of n. Write a function that takes a sorted linked list of entries and produces a balanced binary search tree. Ifuseful, you may add extra parameters to the procedure, such as the tota] number of entries in the list. Hint: First build the left subtree of the root, then the right subtree of the root, then put the Pieces together with the join function from Self- Test Exercise 26 on page 531. Think recursively