Consider the sequence defined recursively by a₀ = 0, and a_n = 2a_n-1 + 1 for n >= 1

(a) Compute a₁, a₂, a₃, a₄, a₅

(b) Conjecture a nonrecursive definition (explicit formula) for this sequence.