Question: Hey! Can anyone please complete this Java programming assignment? I am a beginning programmer so please keep the code as simple as possible, with comments,
Hey! Can anyone please complete this Java programming assignment? I am a beginning programmer so please keep the code as simple as possible, with comments, while following the guidelines described for the project. The program MUST use recursion! Also, please use try/catch for any exceptions that may be thrown. If you need any additional information feel free to ask me. Thank you very much!



In this program you will be taking numbers (as digits) entered by the user and printing them out in English one digit at a time. You will be applying your knowledge of recursion to make this program. You will need to check if the user entered a valid number (or numbers) in a JOptionPane dialog box, if not, display an error message in a JOptionPane dialog box, and re-prompt the user. Then go through each number given by the user, one at a time (a loop will be helpful here). Try to convert the string to an integer, if there is an error, display an error message and continue to the next number if there is one (you might need to try and catch something here). If the number parses successfully, you should check if the number is negative, and print out the word "Negative" before any of the digits if it is After successfully retrieving the number, call printDigits2Num 0 with the number. After finishing with the current number, loop again and complete the rest of the user entered numbers if there are any. private void printDigits2Num (int num); This is the recursive method to display all the digits in their English format. Note: this method must be recursive, and you may not add any extra parameters to the method. If the function is not recursive, or you change the parameters, you will receive 0 points for this program. With each recursive call to printDigits2Num 0 print out the rightmost digit of num in its English format. Determine if you need to make another recursive call, this will happen when num contains more than one digit. After the recursive call isolate the rightmost digit of num (there is a simple math operation to use here). Since num might be negative, you should
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
