Helllp it’s for mathhh

The number of branches on a tree demonstrates the fibonacci sequence. how many branches would there be on the next two levels of this tree? 13 | | | m branches

Type the correct answer in each box. spell all words correctly. a sequence of transformations maps ∆abc onto ∆a″b″c″. the type of transformation that maps ∆abc onto ∆a′b′c′ is a . when ∆a′b′c′ is reflected across the line x = -2 to form ∆a″b″c″, vertex of ∆a″b″c″ will have the same coordinates as b′.

Asequence has its first term equal to 4, and each term of the sequence is obtained by adding 2 to the previous term. if f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence? (1 point) f(1) = 2 and f(n) = f(n − 1) + 4; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2n; n > 1 f(1) = 2 and f(n) = f(n − 1) + 4n; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 i will award !