Write a Java program that has the following inputs and outputs:

Bisection To find a solution to f(x given the continuous function f on the interval [a, b], where f(a) and f (b) have opposite signs: INPUT endpoints a, b; tolerance TOL; maximum number of iterations No OUTPUT approximate solution p or message of failure. Step 1 Set i FA- f(a). Step 2 While i No do Steps 3-6 Step 3 Set p a+(b - a)/2; (Compute p..) FP = f (p). Step 4 If FP = 0 or (b-a)/2 0 then set ap: (Compute a, b,.) FA=FP else set b- p. (FA is unchanged.) Step 7 OUTPUT ('Method failed after No iterations, No'No (The procedure was unsuccessful.) STOP