Minimize the function f on the interval [a, b] with precision at least tol using inexact method with Armijo's rules (no curvature constraint). You can take c = 0.8, C2 = 3. Assume that variables f, a, b are already defined. You need to output the point of the minimum of the function using the standard print statement. You can start building the sequence of points with either a or b. To compute the derivative of a function at a given point use the approximation for c= tol. Make sure you never drop out of optimization bracket. Sample Input 1: from math import sin a = 2. b = 7. tol = 0.000001 f = sin Sample Output 1: 4.712388985743289 Sample Input 2: from math import sin f = lambda x: ***1.8 - 15*x + 4 - sin(x) a = 2. b = 30. tol = 0.000001 Sample Output 2: 14.14704643885404 Minimize the function f on the interval [a, b] with precision at least tol using inexact method with Armijo's rules (no curvature constraint). You can take c = 0.8, C2 = 3. Assume that variables f, a, b are already defined. You need to output the point of the minimum of the function using the standard print statement. You can start building the sequence of points with either a or b. To compute the derivative of a function at a given point use the approximation for c= tol. Make sure you never drop out of optimization bracket. Sample Input 1: from math import sin a = 2. b = 7. tol = 0.000001 f = sin Sample Output 1: 4.712388985743289 Sample Input 2: from math import sin f = lambda x: ***1.8 - 15*x + 4 - sin(x) a = 2. b = 30. tol = 0.000001 Sample Output 2: 14.14704643885404