Re write the code given as a recursive method and state the recurrence equation and the time complexity in theta notation

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) f int start-0 int end A.length 1 while (startend) int result Alstart]+A[end]; if (resultX) return true; else if (result> X) end- else start++ return false