can you write down the full code for those problem ? thanks

Approximate the minimum of unimodal function f(x) where x is a real number x elementof [a, b], approximate or locate x = argmin f(x) using (a) Fibonacci search method (5 steps), (b) Golden ratio search method (5 steps), (c) Newton method with modifications (compute 3 steps). If Newton method fails, explain why and suggest an improvement. Use the following unimodal test functions f(x) f_1(x) = -.2x^4 + x^2 - x, x elementof [-1: 1], x_0 = -1. f_2(x) = 1 - exp(-x^2), x elementof [-3: 3], x_0 = 2.5. f_3(x) = squareroot x^2 + 3, x elementof [-3: 3], x_0 = -2. Plot the functions, list the points of evaluation