Calculate ProductGet ‘n’ input from the user and find the product of all those numbers. When the input is provided as a negative number, it should not be considered for sum. But  the iteration should be continue and finally the sum needs to be printed. Input : First input is the value of ‘n’. It should be followed by n numbers.  Output : The product value. Sample Input 1 : 62-22144-612 Sample Output 1 :1344Sample Input 2 : 4-12222-45 Sample Output 2 :44 Explanation : Here n = 4. So loop should iterate 4 times. But 2nd and 4th input are negative which should not be considered for product. Hence the output is the product of 22 * 2 as 44.Rearrange the shuffled code.int value=sc.nextInt();import java.util.Scanner;public class Test{product = product * value;}}public static void main(String args[]){Scanner sc=new Scanner(System.in);}int n = sc.nextInt();int product=1;System.out.println(product);continue;if(value < 0)for(int i=1 ; i<=n ; i++ ) {

Calculate sum Get ‘n’ input from the user and find the sum of all those numbers. When the input is provided as a negative number, the iteration should be stopped and the sum needs to be printed. Input : First input is the value of ‘n’. It should be followed by n numbers. Stop getting input when a negative number is provided. Output : The sum value. Sample Input 1 : 612222345614 Sample Output 1 :122Sample Input 2 : 6122223-45 Sample Output 2 :57 Explanation : Here n = 6. So loop should iterate 6 times. But 4th input is -45 which is negative. So the loop should terminate and print the sum of 12 + 22 + 23 as 57.Rearrange the shuffled code.public static void main(String args[]){Scanner sc=new Scanner(System.in);break;if(value < 0)System.out.println(sum);for(int i=1 ; i<=n ; i++ ) {sum = sum + value;}}import java.util.Scanner;public class Test{}int value=sc.nextInt();int n = sc.nextInt();int sum=0;

Oliver is creating a mathematical tool to calculate the product of all non-zero digits in a given number. He wants to develop a program that reads an integer input, uses a for-each loop to iterate through each digit, and computes the product of the non-zero digits.Can you assist Oliver in this?Input format :The input consists of a single integer n.Output format :The output prints the product of all non-zero digits in the given integer.Refer to the sample output for formatting specifications.Code constraints :1 ≤ n ≤ 1010Sample test cases :Input 1 :1089Output 1 :72Input 2 :123Output 2 :6Input 3 :50140Output 3 :20

Problem Statement:Find the product of numbers from 1 to given nInput FormatA single integer - nOutput FormatPrint the productConstraints1<= n <= 1000000NOTE : The calculated product value might exceed integer range.Sample Input 1:10Sample Output 1:3628800Sample Input 2:5Sample Output 2:120

Problem StatementInduja is intrigued by the idea of calculating the product of all odd numbers from 1 to N (inclusive). She needs a program that can quickly perform this multiplication for any given integer. Write a program to help her that takes an integer as input, calculates the product of odd numbers from 1 to N using a function called OddMultiply(), and then prints the result.Input format :The input consists of a positive integer, N.Output format :The output prints the result of the product of odd numbers between 1 and N (inclusive).

Using recursion, debug the following program to find 1+2+...+N, where N is obtained from user.Sample Input:4Sample Output:The result is 10