Let bn be the number of binary strings of length n which do not contain two consecutive o's (a) evaluate bi and b2 and give a brief explanation b) give a recurrence relation for bn in terms of previous terms for n 2 2 explain how you get your recurrence relation (c) find the general solution of this linear recurrence relation. (d) find a closed form representation for bn

1st part is 64,000,000

2nd part 500,000

step-by-step explanation:

vertical asymptote .

horizontal asymptote .

step-by-step explanation:

given function is .

vertical asymptote is given by setting

denominator =0

when degree of numerator and denominator are same then divide first term of numerator by first term of denominator to get horizontal asymptote.

arc length = radius * x ( in radians)

6 * pi = 18 * x

divide by 18 on each side

6 pi / 18 = x

pi/3 = x

the angle is pi / 3 radians

or   60 degrees

how many friends does he have? i think some of the information got cut off in the problem.