Q5: Consider the following recurrence (10 Points): a) Apply the substitution method over the recurrence to prove whether the following notation is correct or not. $$ \mathrm{T}(\mathrm{n})=\mathrm{0}(\mathrm{n} \lg \mathrm{n}) $$ b) Using Recursion tree method, Find the asymptotic bound for the above recurrence. c) Using Iteration method, Find the asymptotic bound for the above recurrence. cs.vs. 1190||