A square of tiles with a side of k uses k × k tiles. Write side_for(n) to return the smallest side k so that k × k is more than n.
side_for(10)→4side_for(16)→5def side_for(n):
k = 1
# your code here: while k × k is not big enough, add 1 to k
return k
Run tries the examples. When they look right, Submit.