The function sqrt from the header file can be used to find the square root of a nonnegative real number. using newton’s method, you can also write an algorithm to find the square root of a nonnegative real number within a given tolerance as follows: suppose x is a nonnegative real number, a is the approximate square root of x, and epsilon is the tolerance. start with a = x.
a. if |a2 - x| less or equal than epsilon, then a is the square root of x within the tolerance; otherwise:
b. replace a with (a2 + x) / (2a) and repeat step a in which |a2 - x| denotes the absolute value of a2 - x. write a recursive function to implement this algorithm to find the square root of a nonnegative real number. also, write a program to test your function.
turn in your source code file and one or more screen shots showing the results of your testing. after completing this project you will show that you can identify the base case(s) and general case in a recursive algorithm
utilize tail recursion in the construction of a recursive algorithm
construct a recursive algorithm that does not use global variables