A recursive function is defined as follows: fn=2*fn-2 + fn-1 with fo = 2, and f1=4, for all n>1 The function definition above is equivalent to: f(n)=2*f(n-2)+f(n-1) with f(0) = 2, and f(1) = 4, for all n>1 Question: Write a recursive function using the function prototype below. What would be the value returned by recursiveFunction if 17 is passed as an argument? This is, if int x-recursive Function (17), what would be value of x?[RECURSIVE_VALUE]. //Function prototype int recursiveFunction (int);