5 (a) - The Babylonian algorithm to compute the square root of a positive number n is as follows:

1. Make a guess at the answer (you may pick n/2 as your initial guess) 2. Compute r = num / guess 3. Set guess = (guess + r) / 2

4. Go back to step 2 for as many iterations as necessary. The more step 2 and 3 are repeated, the closer guess will become to the square root of n.

Type a C++ function using the above algorithm, named TheSquareRoot that takes a positive number of type double as its argument and iterates through the Babylonian algorithm until the change of the guesses is within 1% of the previous guess.

5(b) The Fibonacci sequence is as follows: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, ...

Type a C++ function named fibLessThanLargest that takes a positive integer n as its argument and returns the largest Fibonacci number less than n. For example, fibLessThanLargest(144) returns 89 and fibLessThanLargest(28) returns 21