Computer Science, asked by anthatisnehaa36, 2 months ago

solve the following recurrences exactly.
T(1) = 1 ,T(2) = 6 and for all n>=3 TC(N) = T(n-2) + 3n+4

Answers

Answered by nr6944774

0

Answer:

I dont know the answer you search in chrome I hope its help you

Previous Question

Next Question

Similar questions

Hindi, 29 days ago

तीन पग में स्त्रियों की क्या स्थिति थी प्रकाश डालिए...

Physics, 29 days ago

What is Matter made of?

Chemistry, 29 days ago

what is added to a yellow chromate solution to covert it to an orange dichromate solution? (A)dil. alkali (B)any oxidising agent (C)dil. acid (D)any reducing agent...

Biology, 2 months ago

deffrentiate between active membrane potential and resting membrane potential...

Math, 2 months ago

One of the exterior angles of a triangle is 800 and the interior opposite angles are equal to each other. What is the measure of each of these two angles ? STEPS PLS...

Math, 9 months ago

you can answer any questions from a and b but fast ...

Physics, 9 months ago

In a area of 2500cm2 a forces of 50 N applied What is the pressure ??? please please explain step by step ...

English, 9 months ago

if matrix A is of order 3×4 then the each row of matrix A contain element ...