In C++: Given the following recursive definition seq (1) = seq (2) = 1 seq(n ) = 2* seq ( n -1) + 3* seq ( n -2) implement the corresponding program and use it to calculate seq(5). How many...

In C++:

Given the following recursive definition

seq(1) =
seq(2) = 1

seq(n) = 2*seq(n-1) + 3*seq(n-2)

implement the corresponding program and use it to calculate seq(5).

How many invocations are made to the function
seq
when calculating
seq(5)?