Recurrence relations
(1) find a recurrence relation for the number length n bit strings that start and end in 1 (where n > = 2)
(2) use this recurrence relation to find the number of permutations of a set with n elements using the expansion method.

we know that

applying the law of sines

°

so

∠j=18°

∠k=29°

∠l=180-(18+29)=133°

the answer part a) is

the measure of angle k is  ≈29°

part b)  the measure of angle k could also be

(180-29)=151°

so

∠j=18°

∠k=151°

∠l=180-(18+151)=11°

the answer part b) is

the measure of angle k could also be 151°

read more on -

r(0,90)(x,y) . t(-5,0)

last option

step-by-step explanation:

∆def to ∆d"e"f"

- rotate 90 counterclockwise degrees

- then translated 5 to the left (x --> x - 5)

answer is the last option

central angle of a triangle has the same measure as its intercepted arc.

step-by-step explanation:

c.

step-by-step explanation: