Provide an asymptotic formula for each of the following recurrence equations, utilizing big “Θ” rather than just big “O” for better results whenever possible. Show that the values for the next five values of T(n) in each case.
1) T(n) = 5T(n-5) + 1, T(1) = T(2) = T(3) = T(4) = 1.
2) T(n) = 3T(?n/4?) + 2n, T(0) = T(1) = 1.
3) T(n) = 4T(?n?/2) + 2 n2 , T(1) = 1.
4) T(n) = 1/n +T(n-1), T(1) = 1.