Given the following pseudocode and assuming that the print is the basic operation, (1) set up the initial recurrence as a function of n, (2) solve the recurrent equation using the back substitution method, and (3) check your results with the Master Theorem. func doSomething (n) { if n <= 0: return; for (i = 0; i