I need a little help with solving this practice problem
Using C/C++, write a recursive functionand afunction of iteration respectively.Both functioncalculate and return the following sequence. The sequenceS satisfies the following recurrence relation: the firstthree number of the sequence is 0, 1, 2, from the 4th one, eachnumber is equal to the sum of its preceding three numbers; i.e.,given position n≥4, the nth S sequence number is:
S(n) = S(n-1) + S(n-2) +S(n-3)
Note: in main(), you need to call the functions by passing only theposition number n.
Expert Answer
An answer will be send to you shortly. . . . .