1. Write a computer software that implements this algorithm. Submit all your code. (4 points) 2. Find a continuous function f : R"R such that the original Newton's algorithm does not converge, but the Levenberg modification works. Verify this using your code. (6 points) 3. Find a function f : R-R such that the neither Newton's algorithm nor Levenberg's modi- fication converges, regardless of how , k is chosen in Levenberg's modification . Verify using your code. (10 points) 1. Write a computer software that implements this algorithm. Submit all your code. (4 points) 2. Find a continuous function f : R"R such that the original Newton's algorithm does not converge, but the Levenberg modification works. Verify this using your code. (6 points) 3. Find a function f : R-R such that the neither Newton's algorithm nor Levenberg's modi- fication converges, regardless of how , k is chosen in Levenberg's modification . Verify using your code. (10 points)