Solve the following problem. For this problem, your solution will include a written portion with analysis, followed by a C++ implementation. Thank you.

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. 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