Given an array A of N distinct integer elements with the following property:

The first k elements (0 < k < N - 1) are in strictly increasing sequence followed by the strictly decreasing sequence.

Example: A = {1, 3, 4, 5, 7, 14, 11, 7, 2, -4, -8}. It monotonically increases from 1 to 14, then decreases from 14 to -8

Implement a sublinear running time complexity program in Java that, given an array with the previous property, determines whether a given integer is in the array.

(b.1) Implement a sublinear running time complexity recursive function in Java public static long exponentiation(long x, int n) to calculate x^n. (b.2) What is the running time complexity of your function? Justify (b.3) Give a number of multiplications used by your function to calculate x^63. Justify.