Answer Happy

Posted: **Tue Jul 12, 2022 8:20 am**

: 1 Solve The Recurrence By Repeated Substitution T 1 1 T N 3t N 3 N For N 1 Assume That N Has The Form 3k 1 (525.9 KiB) Viewed 33 times

1. Solve the recurrence by repeated substitution T(1) = 1, T(n) = 3T(n/3) +n, for n > 1. Assume that n has the form 3k. Verify by an explicit calculation that your solution satisfies the recurrence relation.