How would I show that $2^n - 1$ is a solution to the recurrence relation:

Question

$a_n$ = 2$a_{n-1}$ + 1, with the initial conditions $a_0$ = 0, $a_1$ = 1

Apparently the solution is from the Tower of Hanoi problem, but having trouble coming with the this on my own.