* The code must be in java.

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