Given a sorted array, write a program named as ProblemB.cpp that creates a Binary Search Tree. Hints: •Write a recursive function to do the followings: a) Get the Middle of the array and make it root of the BST. b) Recursively call a function to do the same for left subarray (0 .. mid-1) and right subarray (mid+1..size-1). i) Get the middle of left half and make it left child of the root created in step a. ii) Get the middle of right half and make it right child of the root created in step a. c) return root.

Complete the below function (using recursion)

Construct recursive versions of the library functions that: a. calculate the "sum" of a list of numbers. b. "take" a given number of elements from the beginning of a list. c. select the "last" element of a non-empty list .

Complete the combinations function to generate all combinations of the characters in the string s with length k recursively

Quick Sort We choose an element from the list, called the pivot. We'll use it to divide the list into two sub-lists. We reorder all the elements around the pivot The ones with smaller value are placed before it All the elements greater than the pivot after it. After this step, the pivot is in its final position. This is the important partition step. We apply the above steps recursively to both sub-lists on the left and right of the pivot.   Quick Sort (Example) Consider the following array Arr[] = {5, 9, 4, 6, 5, 3} Let's suppose we pick 5 as the pivot for simplicity We'll first put all elements less than 5 in the first position of the array: {3, 4, 5, 6, 5, 9} We'll then repeat it for the left sub-array {3,4}, taking 3 as the pivot There are no elements less than 3 We apply quicksort on the sub-array in the right of the pivot, i.e. {4} This sub-array consists of only one sorted element We continue with the right part of the original array, {6, 5, 9} until we get the final ordered…

IN JAVA Write recursive code and iterative code for binary search.