Question $17($Bonus$)(5$ points$)$

$$ Saved

Consider the below recursive algorithm that calculates the nth term of a specific sequence. What is the recurrence relation and initial condition that, when solved, gives the number of times multiplication is executed?

ALGORITHM RecursiveSequence $(n)$Recurrence Relation: T$($n$)=$T$($n$-1)+1,$ Intital Condition: T$(1)=0.$

Recurrence Relation: $T(n)=T(n-1)+2.$ Initial Condition:

$T(1)=1.$

ence Relation: $T(n)=T(n-1)+1,$ Intital Condition: $)=1.$

Recurrence Relation: $T(n)=2T(n-1)+3.$ Intital Condition: $T(1)=0.$