I'm using Jupyter Notebook, Python:

Write a function BSR (a) that returns the square root of a number using the Babylonian algorithm and the number of iterations it took. Use a while loop. For example: def BSR (a): # put some initialization statements here f# more code while # something is true : # put some code here # calculate x = value of square root i+ 1 return (x, i) print "The square root of",17,"is"BSR (17) Demonstrate that your function works by finding 17, v26, and V36