Use induction to find an integer $b > 0$ such that $f(n) \leq bn$ for all $n > 0$
My Attempt!
Basis:
Let $n = 1$
$f(n) = 6$ [Def of f] and $bn = b$
Therefore we need $b \geq 6$
Let $n = 2$
$f(n) = 12$ [Def of f] and $bn = 2b$
Therefore we need $b \geq 6$ (*)
$\vdots$
Let $n = 8$
$f(n) = 48$ [Def of f] and $bn = 8b$
Therefore we need $b \geq 6$
Inductive step: Let $n \geq 9$. Suppose $f(j) \leq b(j)$ whenever $1 \leq j < n$ [I.H]
Trying to show: $f(n) \leq bn$
$f(n) = 2f(\lfloor \frac{n}{9} \rfloor) + 3f(\lceil \frac{n}{4} \rceil) + 5n$ [Def of f; $n \geq 9$]
$\leq 2b\lfloor \frac{n}{9} \rfloor + 3b\lceil\frac{n}{4} \rceil + 5n$ [I.H.]
$\leq b(\frac{2n}{9} + \frac{3n + 9}{4}) + 5n$ [Ciel and floor algebra]
$= b(\frac{8n + 27n + 81}{36}) + 5n$ [Algebra]
$= b(\frac{35n + 81}{36}) + 5n$ [Algebra]
How do I find b?? Very confuse
