Answer Happy

Q2 Induction 20 Points T(n)=8⋅T(2n​)+n4. Obtain an upper bound in big-O, by induction. Show all steps as in the course notes, this is just as important as getting the final answer. You can use this: $T(n)= 8lcdot T(\frac{n}{2})+n∧4$