Write a RECURSIVE solution to this problem. Your solution MUST use recursion in a meaningful way. You may not use any loops anywhere in your solution. I recommend using a helper method to avoid using the lengthy method name. This method accepts an array of TEN single digit integers and an integer called 'origNum'. This method returns a new integer where each digit in 'origNum' has been replaced with a digit from 'digits' such that the value of the digit in 'origNum' is the index in 'digits' in which to find the new digits. I understand that the above paragraph is hard to comprehend. So here is an example: Supposed 'digits' is {5,2,1,9,4,4,4,1,1,1} and 'origNum' is 578132. In that case you would return 411291. The logic behind this is that each digit in 'origNum' indicates a position in 'digits' to find the new digit. So the 5 in 'origNum' means to look in index 5 in 'digits'. At that location there is a 4, so that 5 becomes a 4. Likewise, the 7 in 'origNum' means to look in index 7 of 'digits' which contains a 1. The entire new number is constructed from the old number ('origNum') this way. While recursion is REQUIRED for this problem, that requirement will probably help you as it is much easier to do recursively anyway. Think recursively and you should do fine! Also, as always, don't forget to examine the test data and make sure you understand those results. HINT: I used a helper method, just so I could shorten the method name. I wrote the original method with a body of just one line of code. The helper method also only had one line of code in the body. Don't make this harder than it is!