Hello please help me with this question in maths and programming.
—————————-
Problem description:
Bisection is one of the reliable algorithms for solving non-linear equations.
Given a non-linear equation f(x)=0, continuos over an interval [a,b], if f(a)f(b)<0, then it implies that a real root exists in [a,b].
We therefore determine a point c1 such that c1 = (a+b)/2, now the interval is divided into two sub-intervals, that is, [a,c1] and [c1,b], we again test if f(c1)=0, c1 becomes the root stop.
Otherwise, we test whether f(a)f(c)<0 or f(c1)f(b)<0 to identify the sub interval that contains the root. The procedure is repeated until the root is found. Determine the root manually.
Tasks:
a)identify the necessary inputs and outputs of the algorithm
b)Use high level programming to write a program implementing bisection algorithm
c)Test the algorithm using 6x^2-x-35=0 over [-1,3]