(d) Most operations on a binary search tree have complexity that is proportional to the depth of the tree. Consequently, it is often advantageous to try to create a balanced tree whose depth is minimal. (0) Using pseudo-code or C code, write an algorithm that takes as input a sorted array of size N and returns a binary search tree of depth O(log, N) in which all the values from the array are stored. 12071