What is the result of the following recursive function when called with mm(10)? Write out the execution trace of this call to mm(10).
long mm(int n) {
}
if ( n < 2 ) return 0;
if ( n % 3 == 0 ) return -1;
if ( n % 3 == 1 ) return 1;
else return 2*mm(n-1) + 3*mm(n-2);