What is the recurrence equation of Algorithm foo?

Algorithm foo $($ A $[1..$n$])$

if $\backslash (\backslash$mathrm$\{$n$\}=1\backslash )$ return $0$ ;

else if $\backslash ((\backslash$mathrm$\{$n$\}\backslash \%2=0)\backslash )$

return $2*$foo$($A$[1..$n$/3])$

else

return foo$($A$[1..$n$/3])$

Yan$$t$$n$$z

What is the complexity of Algorithm foo?

Yan$$t$$n$$z

What is the complexity of Algorithm bar?