C++ programming (using bool, if, for, while, etc)

1.

2.

Modify the program you wrote for last week's Stretch Exercise (1) so that it has the Babylonian algorithm as a user-defined square-root function. Start by defining a function named babylonianRoot, that takes a single floating-point argument and returns the square root estimate using the code you completed in your earlier solution. double babylonianRoot (double n); You'll need to modify your previous code slightly, e.g., it should return the last guess for the square root, but should not use >oror