HI , WOULD U PLZ HELP ME IN GETTING CODES IN C AND C++ FOR SOLVING THE FOLLOWING NUMERICAL METHODS to find an approximate root:

BISECTION METHOD stoppingconditi on F(Pi)<tolerance or Ibi-aiI<tolerance
SECANT METHOD NEW APPROXIMATE ROOTxi+1=Xi+1-{f(xi)(xi-1-xi)/{f(xi-1)-f(xi) stopping conditionF(xi+1 )<tolerance or {xi+1-xi}/{xi+1
FALSE POSITION METHOD Xr=X-{{F(Xu)(Xu-Xl)}/f(Xu)-f(Xl)}STOPPING CONDITION {Xrnew-Xrold}/Xrnew<tolerance or...