Any random element from the given Binary Search Tree is to be searched using the standard algorithm. In the Binary Search Tree given in the above problem (i) Determine the average or expected number of comparisons required to locate the element. (ii) determine the number of comparisons in the worst case.

Solve the following problem using balanced binary search trees (TreeSet or TreeMap whichever is appropriate). Given array A of integers, and integer x, find a pair of integers i #j with A[i]+ A[j] = x. The array is not sorted, but it does not contain duplicate elements. If there are multiple pairs that sum to x, choose a pair in which the smaller of two elements is as big as possible. For example, if A = {3, 6, 4, 1, 5, 2} then sumOf(A, 8) returns {0, 4} corresponding to the pair A[0] = 3, A[4] = 5, whose sum is 8. Note that this pair is preferred to (1, 5}, because min(A[0], A[4]) = 3, which is bigger than min(A[1], A[5]) = 2. %3D %3D %3D %3D Class Pair { int one, two; Pair (int a, int b) {one a; two b;} Pair sumOf (int [] A, int x) //code to solve the problem; RT should be 0(n log n)

BACKTRACKING

Construct a Divide and Conquer-based algorithm for the following problem andanalyze the same in the worst case.Input: An ordered array L with n elements and item X that is to be searched inthe array L.Output: Index j where L[j]=X, if X is found or else j = 0, if X not found.