For this Question: Given an integer N and an integer K, Your task is to multiply the first leftmost digit of the number to the number itself. You have to repeat this process K times.
For eg:- if N=3 and K=5 then:
3 * 3 = 9
9 * 9 = 81
81 * 8 = 648
648 * 6 = 3888
3888 * 3 = 11664<b>User Task:</b>
Complete the function <b>KOperations()</b> that takes the integer N as parameter.

<b>Constraints:</b>
1 <= N <= 100
1 <= K <= 10^9Return the Number after K operations

<b>Note:</b> It is guaranteed that the output will always be less than 10^17.Sample Input:-
3 5

Sample Output:-
11664

Explanation:- See problem statement for explanation.

Sample Input:-
22 2

Sample Output:-
176, I have written this Solution Code: import java.util.*;
import java.lang.*;
import java.io.*;

class Main
{
    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        long x  = sc.nextInt();
        long y  = sc.nextInt();
        System.out.println(KOperations(x,y));
    }


public static long KOperations(long N, long K){
    long p=N;
    while(K-->0){
        p=N;
        while(p>=10){
            p=p/10;
        }
        if(p==1){return N;}
        N=N*p;
    }
    return N;
}



}, In this Programming Language: Java, Now tell me if this Code is compilable or not?