In java, use the idea of Binary Search algorithm to write a square root function that asks a user to enter an integer N and returns the integer ceiling of the square root.

(Note: You are NOT allowed to use the predefined sqrt function. The running time of your solutions should be O(logn))

please explain each line of code as much as possible. Thanks!