Find the solution for each of the following recurrences with the iteration method (explicit substitution method): (a). () = (1) + ^n with (0) = 1,, where > 1 is some constant. (b). () = 2 (1) + 1 with (0) = 1. (c). () = (1) + with (0) = 0.

Question 3 (30 points). Find the solution for each of the following recurrences with the iteration method (explicit substitution method): (a). T(n)=T(n1)+cn with T(0)=1, where c>1 is some constant. (b). T(n)=2T(n1)+1 with T(0)=1. (c). T(n)=T(n1)+n with T(0)=0