Any help! There's not enough time

Java labb

A Harshad number is a positive integer that is divisible by the sum of its digits. Write a method that checks if a number passed to the method is Harshard or no. For example, 12 is divisible by 3=1+2), but 32 is not divisible by 5=3+2). Write also a main method to check if a number entered by the user is Harshard or no. The program will give the option to the user to enter many numbers. The program stopes when the user enters a value different from y. Finally, the program should display the total of Harshad numbers found. If no harsher number if found the program displays "No Harshad number is found" Sample runi: Enter a nb:12 12 is a Harshad number Do you want to test a new number (y):y Enter anb: 32 32 is not a Harshad number Do you want to test a new number (y):y Enter a nb:18 18 is a Harshad number Do you want to test a new number (y):n We found 2 Harshad number (s) Sample run2: Enter a nb:19 19 is not a Harshad number Do you want to test a new number (y):y Enter a nb:25 25 is not a Harshad number Do you want to test a new number (y):n NO Harshad number is found