Consider the following algorithm segment.

For each positive integer $n_2$ let $b_n$ be the number of iterations of the while loop.

$)>(0$

$($a$)$ Which of the following is an order for the algorithm segment?

$(lo{g}_3(n))$

$(n^3)$

$(\frac{n}{3})$

$(lo{g}_n(3))$

$(3^n)$

link. $($Submit a file with a maximum size of $1$ MB$.)$

No file chosen

This answer has not been graded yet.