Tracing a Recursive Function:

Tracing a recursive function involves following the sequence of recursive calls
and returns to understand how the function executes. Each recursive call creates
a new activation record on the runtime stack, which stores information such as
local variables and return addresses.

As recursive calls are made, activation records are pushed onto the stack. When a
base case is reached, the function begins returning values, and the activation
records are popped from the stack in reverse order. Tracing helps programmers
visualize this process and understand how intermediate results are combined to
produce the final output.

EXAMPLE:

#include <stdio.h>

void processTins(int n) {

    if (n == 0) {
        printf("All tins processed!\n");
        return; 
    }

    printf("Processing tin number %d...\n", n);


    processTins(n - 1);
}

int main() {
    processTins(3); 
    return 0;
}