I can solve the question below using recursion and the logic of comparing the ones place digit, tens place digit and so on. But how do I solve this problem using ?

1. String
2. ArrayList

"Solve recursive methoddigitMatchthat accepts two non-negative integers as parameters and that 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 ofdigitMatch(1072503891, 62530841), the method would compare as follows:

1 0 7 2 5 0 3 8 9 1 | | | | | | | | 6 2 5 3 0 8 4 1 

The method should return4in this case because 4 of these pairs match (2-2, 5-5, 8-8, and 1-1). Below are more examples:

Your method should throw anIllegalArgumentExceptionif either of the two parameters is negative. You are not allowed to construct any structured objects other thanStrings (no array,List,Scanner, etc.) and you may not use any loops to solve this problem; you must use recursion."