Could you please solve in c++...Thanks

Using C/C++, write a recursive function and an iteration (loop) function respectively. Both function calculate and return the result of a sequence number. The sequence S satisfies the following recurrence relation: the first four numbers of the sequence is 1, 2, 3, and 4, from the 5t one, each number is equal to the sum of its preceding four numbers; ie, given position ne5, the nth S sequence number is: SnSn-1)+ S(n-2)+ S(n-3)+S(n-4)