Write the recurrence (without solving it) for the running time of the following algorithm:

int function(n)

{

int x = 0;

if (n == 0 || n == 1)

return n;

for (int i = 0; i < n; i++)

x = x + i;

return x + function(n-1) + function(n-2);

}