What is happening in Recursion After return; is executed

#1

at n ==0, the return statement will get executed; after return, our function ends, so how it is moving to the next line of PD(n-1),
and how do all the functions of pd(4), pd(3) etc get popped out from the stack after n=0?

#2

@discobot Refer to the video of how Stack memory works in your course or else see the first video of recursion use. These videos will clear your doubts. Refer this :

#3

Hi! To find out what I can do, say @discobot display help.