Exercise 1: hteger square root of an integer You need to wirlte a function, nsqrt), that takes as input an integer x, and return the largest integer that does not exceed Vr. You need to abide by the following constraints 1. The time complexity of your algorithm should be O(log x). 2. You cannot use sqrt) function. For example, nsqrt(11) 3, and nsqrt(1369)-37 det nsqrt(x): # do not change the heading of the function In [31: pass # **replace** this line with your code In [11]: print(nsqrt(11), nsqrt(1369) 3 37