Implement and test the following methods. Find the sum of digits of a positive integer number Sum = number itself if (number is a single digit) otherwise sum = the last digit of the number the sum of rest of the digits of the number. public int sumOfDigits(int number) Test this method with following input numbers: 0, 10 231214, 734 2 Given below is a pseudo code for recursive binary search method discussed in class. Implement the binarySearchRecursive method with appropriate parameter types. Write comments identifying the base case and all recursive steps. binarySearchRecursive(Array, key lowindex, highindex) fif lowindex > highindex) return-1 mid (low,index + highindex)/2 if Array mid] > key) return binarySearchRecursive(Array, key lowindex, mid-I) else if (Array[mid]key return binarySearchRecursive(Array, key mid+I, highindex) else return mid binary search Then use the following main method to test your binarySearchRecursive method. public static void main(Stringl] args) initialize an unsorted array int[] arr new int[] {9,34,2,1 5,90,564478, 12.23.86) Arrays.sort(arr); Ilsort the array in ascending order int key = ; // test the program with key values 34. 3. 107, 15 int position = binarySearchRecursive (arr key, 0, arrlength-1.); if (position !=-I) System.out.println Found search key "+key+" at index " position)