In C, with simple code, please.

Notes: Arrays or C built-in root-finding related functions MUST NOT be used in this project. Write (also compile and execute) a complete C program that finds numerically the root (or the zero) of the algebraic equation below in the interval 0.0x5.0 : ln(1+3x3)=atan(x5+1e4x) where, is the square root function, atan() is the arctangent function, e4x is the exponential function and ln( is the natural logarithm function. All these functions are defined in C as: THE BISECTION METHOD: approximates a root of a function (named f(x) ) on an interval containing the root. Assume that xL and xR is an interval [xL,xR] where the function has one root. Assume also that function f is continuous in the interval. If the interval is bisected by computing its midpoint, xM, xM=2xL+xR then, three possible situations may occur: 1. f(xM)=0, then xM is the root of the function; 2. the root is in the left half of the interval [xL,xM]; 3. the root is in the right half of the interval [xM,xR]; If f(xM)=0, then the interval (left half or right half) where the root is located is bisected again. This process is repeated until f(xM)