Please code in Java and keep in mind that it is supposed to be running a sublinear running time complexity! So if the time complexity is O(n) then it is incorrect. It cannot be O(n).

(a) Implement a sublinear running time complexity recursive function in Java public static long long x, int n) to calculate X Note: In your function you can use only the basic arithmetic operators (+, -,, %, and /) (b) What is the running time complexity of your function? Justify (c) Give a number of multiplications used by your function to calculate x63