Write a C program for root finding by bisection for a polynomial. Your program should ask for the coefficients of a polynomial up to 4th order (5 coeffs) starting from the lowest order term and assuming that once a zero is encountered that all remaining coefficients are also zero. Concretely, we are root finding the polynomial of the form where your program should ask the user for the coefficients a e in order, stopping when one is zero As an example if the third coefficient is 0 then the program should stop asking for coefficient inputs and assume that the polynomial is linear. Talk to your TA if this requirement is confusing Your program should follow the following structure and requirements 1. Take Inputs Starting point: a Ending point: b Error Tolerance: TOL . Polynomial Coefficients until a 0 is encountered 2. Check Conditions: . All inputs are of the correct type . The starting point occurs before the ending point a