Rewrite the above code as a recursive method. What is the recurrence equation, and time complexity in theta notation

java

Following is code for an algorithm for finding if two numbers in a sorted array, A, sum to a given number, X. This is the same code as the previous question. public static boolean twoNumbersEqualX(int[] A, int X) int start-0; int end-A.Length 1; while (startend) int result A[start]A[end]; if (result ==X) return true; else if (result > X) end--; else start++; return false