For this Question: Given two positive integers N and M. The task is to check whether N is a <b>Special-M-visor</b> or not.
<b>Special-M-visor</b>: A number is called Special-m-visor if it has exactly M even divisors for a given N.<b>User Task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>checkSpecial_M_Visor()</b>. Where you will get N and M as a parameter.

Constraints:
1 <= N <= 10^6
0 <= M <= 10^6Return "Yes" without quotes if the number N is a <b>Special- M- visor</b> else return "No"Sample Input:-
4 2

Sample Output:-
Yes

Explanation:- 2 and 4 are the only even divisors of 4

Sample Input:-
8 5

Sample Output:-
No, I have written this Solution Code: 
	static String checkSpecial_M_Visor(int N, int M)
	{
	    int temp=0;
		 for(int i = 2; i <=N; i+=2)
		 {
		     if(N%i==0)
		       temp++;
		 }
		 if(temp==M)
		   return "Yes";
		  else return "No";
	}
, In this Programming Language: Java, Now tell me if this Code is compilable or not?