Nthis problem, we will use divide-and-conquer to write a pro-gram that computes the zeros of a given cubic equation. while a cubicformula exists, it is a proven fact that there is no formula that can solveevery polynomial of degree 5, for example, and so it is important to con-sider numerical solutions like the one we will explore here that generalizeto higher-degree polynomials. you may assume that the zeroes ofthese equations lie between -100 and 100 and that distinct ze-roes di er by at least 0.01.your program should take as input fournumbers, each on their own line, representinga, b,c, d(in that order) inthe equationax3+bx2+cx+d= 0.