Given the following sequence for positive integers only: $1,2,12,30,67, \ldots $ Where $X_{n}=n^{2}+x_{n-1}+x_{n-2}$ for $n>$ and $X_{1}=1, X_{2}=2$ Write a recursive C function to compute and retum 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 globol and static variable(s) 3. $A=B \quad I \quad \vdots \quad \mid \equiv \quad \&\quad$ is [2] CS.VS. 1045