the method. Add this new method to the Recursive class. Recursive Sum of Array Elements Write a recursive static method int recArraySumtint nums, int i} that

accepts an array of integers and an index i and returns the sum of all elements of that

array up to and including element with the index i. Test the method in mainO. Hardcode all your test cases. Requirement: Your method must not use any global variables or static ﬁelds. Only local

variables can be used in the method implementation. Add this new method to the Recursive class. Recursive Selection Sort Convert the regular iterative selection sort method into the recursive static one. In order

to achieve that. replace the outer loop in the solution by recursive calls and leave the second (inner) loop to be more or less as it is. Test your method in mainO. Make sure that your code works for arrays of size 1, 2, and 3

as well as a regular unsorted array. Do not use user input when testing the method — hard-

code all the test cases. Requirement: Your method must not use any global variables or ﬁelds. Only local

variables can be used in the method implementation. Add this new method to the Recursive class. Recursive countDigitMatchesO Write a recursive method countDigitMatches(int n1, int n2} that accepts two non-negative

integers as parameters and returns the number of digits that match between them. Two

digits match if they are equal and have the same position relative to the end of the

number (i.e. starting with the ones digit). In other words, the method should compare the

last digits of each number, the second-to-last digits of each number, the third-to-last digits of each number, and so forth, counting how many pairs match. For example, for the

call of countDigitZMatches (1072503 891, 62530341), the method would compare as

follows: