Java Program--Please proof

package demo;

// Java program to find Seed of a number import java.util.*; public class Seed{ static int MAX = 10000; static int[] prodDig=new int[MAX]; // Stores product of digits of x in prodDig[x] static int getDigitProduct(int x) { // If x has single digit if (x res = new ArrayList(); for (int i=1; i Problem Statement Implement a program to find out whether a number is a seed of another number A number X is said to be a seed of number Y if multiplying X by its every digit equates to Y. E.g.: 123 is a seed of 738 as 123*1*2*3 = 738