Recurrences. Give a Θ(n) expression for T(n) for each of the following recurrences using the stated method. Assume that T(n) is constant for n≤2. (a) Master Theorem: T(n)=T(n/2)+n 2
log 2
​
(n) (b) Substitution or Tree: T(n)=T(7n/10)+n (c) Any Method: T(n)=2T(n−2)+n 2
. Revised to T(n)=2T(n−2)+c, where c is a constant.