Is the recurrence T(n) = T(n-1) + T(n-2) + c? Please explain and provide the correct recurrence. If possible, please solve for the running time also.

5. Write the recurrence (without solving it) for the running time of the following algorithm: Algorithm: example(n) if(n=1) return for i = 1 to n x=x+ 1 y- example(n-1) + example(n-2)