find the answer

VA DM HW #3 - MATH 220, section ( X C 4. [2.85/4.78 Points] DETAILS PRE X C This Question Has Several Parts T X + X C a webassign.net/web/Student/Assignment-Responses/submit?dep=25323598&tags=autosave#question3888655_3 a 11. [-/4.78 Points] DETAILS EPPDISCMATH5 5.6.010. MY NOTES ASK YOUR TEACHER Let bor b1, b2, . .. be defined by the formula b = 4" for every integer n 2 0. Fill in the blanks to show that bo, b1, b2, . . . satisfies the recurrence relation bK = 4bk _ 1 for every integer k 2 1. Let k be any integer with k 2 1. Substitute k and k - 1 in place of n, and apply the definition of bo, b1, b2, . . . to both bk and bk - 1. The result is by = 4k (*) and bk - 1 = (* *) for every integer k 2 1. It follows that for every integer k 2 1, 4bK - 1 = 4 by substitution from ? v by basic algebra = by substitution from ? v . Thus, bo, b1, by, . . . satisfies the given recurrence relation. Need Help? Read It LO O 9 9 ~ ( 7 4:48 PM