The program must be complete in java

you must make SCREENSHOT to prove the program is working

the answer posted for the same question is wrong

Question#3. Consider the attached input and output files for solving the below three problems using recursions. You will write a program that will read a set of commands from the input file and execute the relevant recursive method to get the required output, which is shown in the attached output file. Each command in the input file is followed (on the same line of input) by the respective parameters required for executing the recursive method. [15 points for writing the main method, 15 points for writing the recursive method for each of the below problems]:

before solving the program, you make input file called "input.in.txt" . Your program should open and read this file automatically in the main program without prompting the user to enter the name of the input file.

the content of the input file will be :

"

8 eliminateDigit 11712 1 eliminateDigit 332 4 eliminateDigit 666 6 findLargest 32;4;21;-87;3;0;49;143;47 findLargest -32;-4;-21;-87;-3;-43;-7 shuffle abcd efgh shuffle abc fgkl shuffle abcd efg

"

The first line of the input file will contain one positive integer "8", which represents the number of commands (lines) following that line in the input file.

Each of the following n lines in the input file contains a command, which is followed, in the same line, by the required parameters. The commands of the 3 recursive methods, and their required parameters data, are described below:

eliminateDigit: This command will be followed by two integers, a and b where b is a one digit number.

findLargest: This command will be followed by a set of integers numbers which are separated by ';'.

shuffle: This command will be followed by two strings.

Problem#1. Write a recursive method eliminateDigit which accepts a positive integer M (greater than 0) and a digit K and returns an integer number N, such that N is a new number without the K digit occurrences of M. If all M digits are equal to the K digit, then return 0.

Consider the following output examples:

Example 1:

Command: eliminateDigit 11712 1

Output: 72 is the number without digit 1

Example 2:

Command: eliminateDigit 332 4

Output: 332 is the number without digit 4

Example 3:

Command: eliminateDigit 666 6

Output: 0 is the number without digit 6

Problem#2. Write a recursive method called findLargest that accepts only one parameter which is an array of integer numbers and returns the smallest number in that array. Consider the following output examples:

Example 1:

Command: findLargest 32;4;21;-87;3;0;49;143;47

Output: The largest number is: 143

Example 2:

Command: findLargest -32;-4;-21;-87;-3;-43;-7

Output: The largest number is: -3

Problem#3. Write a recursive method called shuffle that accepts two strings of characters, S1 and S2. The method will return a shuffled string of S1 and S2. The shuffled string will interchange the characters of S1 and S2, respectively. So that the first character of S1 will be followed by the first character of S2, and so on. Consider the following output examples:

Example 1:

Command: shuffle abcd efgh

Output: aebfcgdh is the shuffle of abcd efgh

Example 2:

Command: shuffle abc fgkl

Output: afbgckl is the shuffle of abc fgkl

Example 3:

Command: shuffle abcd efg

Output: aebfcgd is the shuffle of abcd efg

please test the code before submitting it

please send screenshot that shows the program is working

Your program must produce an output file, called "output.out.txt". You must follow the exact format of the output file.

"

Commnad: eliminateDigit 11712 1 Output: 72 is the number without digit 1

Commnad: eliminateDigit 332 4 Output: 332 is the number without digit 4

Commnad: eliminateDigit 666 6 Output: 0 is the number without digit 6

Commnad: findLargest 32;4;21;-87;3;0;49;143;47 Output: The largest number is: 143

Commnad: findLargest -32;-4;-21;-87;-3;-43;-7 Output: The largest number is: -3

Commnad: shuffle abcd efgh Output: aebfcgdh is the shuffle of abcd efgh

Commnad: shuffle abc fgkl Output: afbgckl is the shuffle of abc fgkl

Commnad: shuffle abcd efg Output: aebfcgd is the shuffle of abcd efg

"