Complete the code snippet below to implement the findMaxProduct recursive function that prints the maximum product of digits among numbers less than or equal to the given number. If the number is 390, then the result is 216, as the number 389 has the maximum product 3 * 8 * 9 = 216..Input:IntegerOutput:IntegerSample Input 1390Sample Output 1216Sample Input 2432Sample Output 2243

Problem StatementYou are given a function,static String FindMax(int[] arr){}The function accepts an integer array 'arr' of length 'size' as its argument. Implement the function to find and return the maximum number that can be formed by any permutation or arrangement of all the digits obtained from all the numbers present in the array. You have to return the number formed as a string.Note: You may need to rearrange the digits of the numbers to form the maximum number.Example:Input:34 79 58 64Output:98765443Explanation:All digits obtained from all the numbers of array are 3, 4, 7, 9, 5, 8, 6, 4. Maximum number obtained after rearranging all these digit gives 98765443. Thus, output is 98765443.The custom input format for the above case:434 79 58 64(The first line represents the 'size', the second line represents the elements of the array 'arr')Sample input21 90 23Sample Output932210The custom input format for the above case:321 90 23(The first line represents the 'size', the second line represents the elements of the array 'arr')Instructions :This is a template based question, DO NOT write the "main" function.Your code is judged by an automated system, do not write any additional welcome/greeting messages."Save and Test" only checks for basic test cases, more rigorous cases will be used to judge your code while scoring.Additional score will be given for writing optimized code both in terms of memory and execution time.Now let's start coding :Language:Read-only code below . . .1class SolutionClass {2    public static void main(String[] args) throws java.lang.Exception {3        //Input read from STDIN4        String result = FindMax(arr);5        //Value in result printed to STDOUT6   }7}8​Write your code below . . .9static String FindMax(int[] arr) throws java.lang.Exception10{11    /* Write your code here. */12}13​

Given an integer n, break it into the sum of k positive integers, where k >= 2, and maximize the product of those integers.Return the maximum product you can get.

Max is developing a program to process a sequence of product identification numbers in a manufacturing plant. Each product ID is a five-digit number, and you need to extract and display the digits of each ID in reverse order while skipping any zeros. Incorporate the break statement in the program to efficiently handle the scenario where the product ID includes leading zeros. In such cases, you should break out of the loop after processing the non-zero digits of the ID.Input format :The input consists of an integer n, representing the five-digit product ID.Output format :The output displays the product ID in reverse order skipping zeroes.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases will fall under the following constraints:10000 ≤ n ≤ 99999Sample test cases :Input 1 :18760Output 1 :6781Input 2 :23075Output 2 :5732Input 3 :10000Output 3 :1Input 4 :99999Output 4 :99999

Problem StatementEmily is a budding programmer who loves solving mathematical problems. One day, she comes across a challenge to find the largest of three numbers using a custom function. Determined to tackle the challenge, she decided to create a program. Can you help her write the code and solve the problem?Function Specifications: double findMax(double a, double b, double c)Input format :The input consists of three space-separated double values a, b, and c.Output format :The output prints a double value which is the largest number of the given three numbers, rounded off to two decimal places.Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:-100.00 ≤ a, b, c ≤ 100.00Sample test cases :Input 1 :2.22 3.98 3.99Output 1 :3.99Input 2 :-99.99 -10.78 -78.56Output 2 :-10.78Input 3 :-54.27 2.54 -23.58Output 3 :2.54

ai is creating a program to find the maximum number from the given two integers using pointers.Help him with the task.Input format :The input consists of two space-separated integers.Output format :The output prints the maximum number.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ input integers ≤ 100Sample test cases :