How do you represent recursion in an activation tree? Generate the three-address code for the following instruction:

n = (a + b) * (c - d);
for(i = 0; i < n; i++) {
    for(j = 0; j < n; j++) {
        x = n + i + j;
    }
}