Let b0, b1, b2, be defined by the formula bn = 4n, for every integer n ≥ 0. Show that this sequence satisfies the recurrence relation bk = 4bk − 1, for every integer k ≥ 1. Let k ≥ 1. Using the formula bk = 4k, write the expression for bk − 1.