no scanner use

and explain how the code will work to get the output

starter code

Create a function named canPartition that receives a single array of integers as a parameter, then returns true if there exists an element in array that is equal to the product of all other elements in the array excluding itself. Otherwise, the function should return false. Header: boolean canPartition( int [] nums) \{ // Type code here \} Example input/Output: - Input: {2,8,4,1} Output: true //8 equals 421 - Input: {1,10,1,2,20} Output: false - Input: {1,20,5,1,2,2} Output: true 1/20 equals 15122 Notes: - The array may contain duplicates - More than one solution may exist. Any solution is enough to return true - public class MyClass \{ static boolean canpartition ( int [] nums ) \{ 3 II WRITE CODE HERE public static void main(string args []){ //TEST CODE HERE }