For this Question: Sara is solving a math problem in which she has been given an integer N and her task is to find the number of operations required to convert N into 1. 
Where in one operation you replace the number with its second-highest divisor.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>DivisorProblem()</b> that takes integer N as argument.

Constraints:-
1 <= N <= 100000Return the number of operations required.Sample Input:-
100

Sample Output:-
4

Explanation:-
100 - > 50
50 - > 25
25 - > 5
5 - > 1

Sample Input:-
10

Sample Output:-
2, I have written this Solution Code: static int DivisorProblem(int N){
int ans=0;
    while(N>1){
        int cnt=2;
        while(N%cnt!=0){
            cnt++;
        }
        N/=cnt;
        ans++;
        
    }
    return ans;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not?