2. Given a sorted array of n comparable items A, create a binary search tree from the items in A which has height h &A, int start, int end);' as your function prototype, which will create a tree from the items in A from indices start to end (inclusive), and return a pointer to the root node of the resultant tree