Consider the following algorithm segment. if x · y > 0 then do y :=4 · x x:=x +1 end do z := x• y Find the value of z if prior to execution x and y have the values given below. (a) x = 3, y = 4 z = (b) x = 1, y = 1 z =

An algorithm should be clear of ambiguity if it has been thoroughly thought out.

The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17                # we want the square root of 17 for exampleg = 4                 # our guess is 4 initiallyerror = 0.0000000001  # we want to stop when we are this closewhile abs(n - (g**2)) > error:  g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point   Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!