'JAVA Problem: The following problem goes by: Multiplies it with 13,followed by 11 and then 7 Outputs all the distinct three-digit numbers possible from the digits ofthe new number (each digit can only be used once) But you father does the following: Given three-digit positive number K, he feeds it to the device for processing: He then takes the numbers it gives as output; and send each ofthem through the device and again collect all the numbers sent out Repeats the above step N times: To test your wit; your father challenges you to develop a JAVA code to find the number of distinct 3-digit numbers which the device outputs over the N steps_ Sample Input:
110 18
Sample Output:'