Consider the following recursive method:

function foo$($a: int, b: int$)=>$ int:

if b $==0$:

return $1$

else:

x $=$ foo$($a$,$ floor$($b$/3))//$ Use integer division

y$=2*$ x

if b $\%2==1$:

y$=$y$+$a

return y

If you invoke the above method with foo $(4,12)$ what is the sequence of return values in the order they are generated?