Question

100pts: Find F(5) if F is a recursive function as defined below:
F(0) = 0,
F(1) = 3,
F(n) = n * F(n-1) + F(n-2)

I GIVE BRAINLIEST

Answer 1

Answer:

F(0) = 0

F(1) = 3

F(2) = 2 x F(1) + F(0) = 2 x 3 + 0 = 6

F(3) = 3 x F(2) + F(1) = 3 x 6 + 3 = 21

F(4) = 4 x F(3) + F(2) = 4 x 21 + 6 =90

F(5) = 5 x F(4) + F(3) = 5 x 90 + 21 = 471

Hope this helps!

:)

Answer 2

Answer:

471

Step-by-step explanation:

F(0) = 0,

F(1) = 3,

F(2) = 2 * F(1) + F(0)

F(2) = 2(3) + 0 = 6

F(3) = 3 * F(2) + F(1)

F(3) = 3(6) + 3 = 21

F(4) = 4 * F(3) + F(2)

F(4) = 4(21) + 6 = 90

F(5) = 5 * F(4) + F(3)

F(5) = 5(90) + 21 = 471