In this problem, we will use divide-and-conquer to write a program that computes the zeros of a given cubic equation. while a cubic formula exists, it is a proven fact that there is no formula that can solve every polynomial of degree 5, for example, and so it is important to consider numerical solutions like the one we will explore here that generalize to higher-degree polynomials. you may assume that the zeroes of these equations lie between -100 and 100 and that distinct zeroes differ by at least 0.01. your program should take as input four numbers, each on their own line, representing a, b, c, d (in that order) in the equation ax3 + bx2 + cx + d = 0.