The function calling is done in preorder while return value in given in post order meaning whenever we call T(n) then T(n-1) we be called first and T(n-2) will only be called once T(n-1) has returned value.
So we begin with n=12 then n=11 is called but n=10 waits until n=11 returns value,
Similarly n=11 calls n=10 but n=9 waits till n =10 returns value.
This goes one till n=1 where we get 1 as return value, so from 12 to 1 we have 12 function calls whose entry will reside in stack at same time and 12x4 =48 will be entry size.
the key point to keep in mind is the order of function calls which is preorder.
Here’s a similar question : GATE CSE 1994 | Question: 21 - GATE Overflow for GATE CSE