need algorithm help in solving recurrences

[webdev]

ok so if T(1) = 3 and T(n) = T(n-1) +2n -3, n > 1 how do i solve for T(n) and how do i then prove it with the verification, inductive hypothesis, and inductive step? same thing for T(1) = 1 T(n) = T(n/2) + bn(logn) where b is a constant (this one deals with domain transformation)