Can someone please walk me through this?

Consider the recursive function below:

void curse(int a, int b, int c, int n)

if( n == 1) return;

curse (b,c,a,n-1);

print(Howdy);

curse (c, b, a, n-1);

Which of the following is an accurate recurrence relation (or equation if you prefer) for the above code?