Ok guys, I really need help with this, I can understand almost everything in my class except induction. Can someone please help me with a solution to the following problem?

Use mathematical induction to show that

is the solution for the recurrence relation:

T(n) = 2T(n–1) + 2 for n > 1 and T(1) = 1

Thanks in advance for any help supplied.