write a matlab code based on bisection and false position methods to find the root of an equation. determine the root of 𝑓(𝑥) = −0.4𝑥^2 + 2.2𝑥 + 4.7 determine the root of 𝑓(𝑥) = (0.9−0.4𝑥)/𝑥 in javascript

main.m
% Define the function
f = @(x) -0.4*x^2 + 2.2*x + 4.7;

% Define the interval [a, b] where the root lies
a = 0;
b = 10;

% Bisection method
tolerance = 1e-6;  % Tolerance for convergence
maxIterations = 100;  % Maximum number of iterations

fprintf('Bisection Method:\n');
fprintf('Iteration\t a\t\t b\t\t c\t\t f(c)\n');
fprintf('--------------------------------------------------------------\n');

fa = f(a);
fb = f(b);
if fa * fb >= 0
    error('The function does not change sign within the interval [a, b]. Bisection method cannot be applied.');
end

for i = 1:maxIterations
    c = (a + b) / 2;
    fc = f(c);
    fprintf('%d\t\t %.6f\t %.6f\t %.6f\t %.6f\n', i, a, b, c, fc);
    
    if abs(fc) < tolerance
        fprintf('\nRoot found at x = %.6f\n', c);
        break;
    end
    
    if fa * fc < 0
        b = c;
        fb = fc;
    else
        a = c;
        fa = fc;
    end
end

% False position method
fprintf('\nFalse Position Method:\n');
fprintf('Iteration\t a\t\t b\t\t c\t\t f(c)\n');
fprintf('--------------------------------------------------------------\n');

a = 0;
b = 10;
fa = f(a);
fb = f(b);
if fa * fb >= 0
    error('The function does not change sign within the interval [a, b]. False position method cannot be applied.');
end

for i = 1:maxIterations
    c = (a*f(b) - b*f(a))/(f(b) - f(a));
    fc = f(c);
    fprintf('%d\t\t %.6f\t %.6f\t %.6f\t %.6f\n', i, a, b, c, fc);
    
    if abs(fc) < tolerance
        fprintf('\nRoot found at x = %.6f\n', c);
        break;
    end
    
    if fa * fc < 0
        b = c;
        fb = fc;
    else
        a = c;
        fa = fc;
    end
end
1623 chars
72 lines