Answer:
The proof is in the explanation
Step-by-step explanation:
is
if
for
.
So, basically, we have to solve the following inequality
![f(n) \leq cn^(3)](https://img.qammunity.org/2020/formulas/computers-and-technology/college/et72s25p7nth4drs5fyru8rjb2ujlc6xzy.png)
![20n^(3) + 10n\log{n} + 5 \leq cn^(3)](https://img.qammunity.org/2020/formulas/computers-and-technology/college/81cd4hrf6px06ohmea83thya6h2gzg5svc.png)
Dividing everything by
to simplify, we have
![20 + \frac{10\log{n}}{n^(2)} + (5)/(n^(3)) \leq cn^(3)](https://img.qammunity.org/2020/formulas/computers-and-technology/college/pu0ho9bk7hoxi8c703j8280byzs1uen3kg.png)
I am going to use
. So
![20 + 5 \leq c](https://img.qammunity.org/2020/formulas/computers-and-technology/college/doze6l5j4g2bayy6cr5087handxweymfu5.png)
![c \geq 25](https://img.qammunity.org/2020/formulas/computers-and-technology/college/gv9e412mcde4vvuulb05yzh95icmwe08ol.png)
There is a solution for the inequality, which proves that
is
![O(n^(3))](https://img.qammunity.org/2020/formulas/computers-and-technology/college/c0snuvbhdoip3sdep46ihpxvjdsd3i8sfz.png)