Using Substitution to Prove an Big O/upper bound is O(n^3)
I need to use a substitution method to prove and show that T(n) is in O(n³) for
$T(n) = 2T(\lfloor \frac{n}{2} \rfloor) + 5n^3 $
for n ? 2, T(1) = 20
I am supposed to come up with an explicit guess for the upper bound instead of trying to reason using order notation.
thanks!
Answer
Answers can be viewed only if
 The questioner was satisfied and accepted the answer, or
 The answer was disputed, but the judge evaluated it as 100% correct.
1 Attachment

It took me about 35 minutes to write this solution. You should offer higher amounts in future, otherwise your questions may not get answered.
The answer is accepted.
 answered
 159 views
 $5.00
Related Questions
 Find H $\langle H \rangle=P+\frac{1}{AD} \sum_{i=0}^{D} ( \sum_{j=0}^{A} ((ji)Step(ji)))$
 Function Invertibility/Inverse & Calculus, One question. Early Uni/College level
 Mechanical principle help (maths)
 Inequalities + limits questions
 Find the domain of the function $f(x)=\frac{\ln (1\sqrt{x})}{x^21}$
 Find $\lim _{x \rightarrow 0^{+}} \sqrt{x}\ln x$
 elements in a set
 Growth of Functions