What would happen if the below function mystery were called with a value of 6 for n? Trace the execution of 'mystery' when called with a value of 6 for n. List all the calls and returns of 'mystery' in the order they occur. For each call give the value passed into the function. For each return give the value returned from the function.

int mystery(int n) { if (n == 2) return 4; else return (n*n) * mystery(n / 2); }