(1) (50 points] Given Array

ARRAY) = (50, 11, 33, 21, 40, 50, 40, 40, 21}

Write a full and complete implementation of the Quick Sort Algorithm

such that the given array gets fully sorted in O(n log2(n)) time complex-

ity overall and O(1) space complexity. Here, n is the length of the list

of input integers (array). Your pivot shall always be the last element of

any array you consider. We will not be considering any memory used by

recursion.

(2) [50 points] Given Array

ARRAY = (11, 21, 33, 40, 50]

Write a full and complete either recursive or iterative implementation of

the Binary Search Algorithm such that you find your target element 21 in

O(log2 (n)) time complexity overall and O(1) space complexity. Here, n is

the length of the list of input integers (array).

You are free to either return the target element or its index.

We will not be considering any memory used by recursion.