$3.$ Consider the following algorithm:

$```$

Algorithm Q$1($n$)$

$//$ n is any positive integer

a

b$\backslash$leftarrow$2$

for $\}$i$\backslash$leftarrow$1\backslash$mathrm$\{$ to $\}$n$\backslash$mathrm$\{$ do

j$\backslash$leftarrow$2$n

while $\}$j$>0\backslash$mathrm$\{$ do

if j$\backslash$leqn then

a$\backslash$leftarrow$3$a$+$b$/8$

j$\backslash$leftarrowj$/3$

else

b $\backslash$leftarrow $5$ b $+$ a $/4$

j$\backslash$leftarrowj$-1$

x$\backslash$leftarrowa$+$b

return x

$```$

$($a$)$ How many times the multiplication is executed in the statement of line $9.$

$($b$)$ How many times the multiplication and addition are executed in the statement of line $12.$

$($c$)$ Which one is the Basic Operation of the algorithm.

$($d$)($Homework$)$ Find the Efficiency of the algorithm and establish its order of growth.