Can anybody finish this java program?

System.out.println nThe strictly monotonic numbers: n") /for every number, separe each digit and store it in monoll //then compare each digit for int i-0i 20i++) int monol-new int[3) int temp-ari index-0 Wevery digit is stored in monol] while(temp!-0) mono[ index++)-temp% 10: temp-temp/10: checking conditions for monotonic number or not if(mono[0] mon)&&(monomono[2] System.out.print(arr[i+t") if (mono[0mon&&(monomon System.out.print(arri+t /2Distinct digits System.out.println nThe pairs: n"); Mike previous one, store each digit in digi] fortint i=0;i