Find a recurrence relation for the number of ternary strings of length n that contain either two consecutive 0s or two consecutive 1s.

y do u put "subscirbe to ence" on a app for ppl who need with their work?

5x+40

5(x + 8)

7x - 49

7(x - 7)

18x + 9

9(2x + 1)

15x - 10

5(3x - 2)

step-by-step explanation:

for number one all you have to do is factor 5 out of 5x + 40

for number 2 factor 7 out of 7x - 49

for number three factor 9 out of 18x + 9

for number four factor 5 out of 15x - 10

m∠5 + m∠3 = m∠1   is true.

m∠5 + m∠6 = 180 is true

m∠2 +m∠3 = m∠6   is true

m∠2 +m∠3 +m∠5 = 180   is true

the olimpics is not going to wokk out

step-by-step explanation: