Given the Array ARRAY[] = [11, 21, 33, 40, 50]

Write JAVA CODE recursive 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. YOU will not be considering any memory used by recursion.

Show input, output, and comments.