Given the following sequence for positive integers only: $0,1,3,8,16, .$.:. Where $X_{n}=\left(X_{n-1}+x_{n-2} ight)^{*} n$ for $n>2$ AND $n$ is multiple of 3 and $X_{n}=X_{n-1}+x_{n-2}+n$ for $n>2$ AND $n$ is not multiple of 3 and $X_{1}=0, X_{2}=1$, Write a recursive $C$ function to compute and return the value of the element at location $\mathbf{n}$. It must be written as a recursive function. The use of loops is not allowed inside this function. You are not allowed to use a global and static variable(s) CS.VS. 1059