For this Question: Given an integer N. The task is to find the square root of N. If N is not a perfect square, then return floor(√N). Try to solve the problem using Binary Search.The first line of input contains the number of test cases T. For each test case, the only line contains the number N.

<b>Constraints:</b>
1 &le; T &le; 10000
0 &le; x &le; 10<sup>8</sup>For each testcase, print square root of given integer.Sample Input:
2
5
4

Sample Output:
2
2

<b>Explanation:</b.
Testcase 1: Since, 5 is not a perfect square, the floor of square_root of 5 is 2.
Testcase 2: Since 4 is a perfect square, its square root is 2., I have written this Solution Code: // n is the input number
    function sqrt(n) {
        // write code here
        // do not console.log
        // return the number

        return Math.floor(Math.sqrt(n))
    }


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