input: Positive integer x Output: Square root of an integer y Step 1: y = 1 Step 2: while (y * y <= x) step 3: y = y+1 Step 4: return yWhat is the running time of the above algorithm. Code is located in lab1-2-2012.cc Can you improve the running time of this algorithm to O(log(n)) and write a code for that.