Solve the following recurrence. (Use either expansion, recursion tree, guess and verification, or master theorem methods. No other methods are accepted) Make your bounds as small as possible (in the big-O notation). For each recurrence, T(n) = O(1) for n 1.

T(n) = 4.1) +nyn 2