How to solve D

make yhe answer look like

Efficiency of the algorithm in $\backslash$Theta order of growth

Consider the following algorithm:

$($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.