Question $2(2$ points$)$

Consider the following recursive algorithm

$```$

int function $($ int a$,$ int b $)$

if $($ b $==1)$

return a

int tmp $=$ function$($ a$,$ b$/2)$

if $($ b $\%2==0)$

return tmp $*$ tmp

else

return a $*$ tmp $*$ tmp

$```$

How many recursive calls are made when we make a call to function$(5,3)?($Include the call to function$(5,3)$ in your count.$)$