Give asymptotically tight big-O bounds for T(n)

in each of the following recurrences. Justify your solution by naming the master method case, by iterating the recurrence, or by using the substitution method.

a)T(n)= T(n-2)+1

b) T(n)= 2T(n/2) +n lg^{2 n}

e. T(n) = T(n/2 + n^0.5) + n

please write correct complete answers and explain it with clear hand writing, otherwise type it.

Thanks