Simplicity, however, count only comparisons that occur within if$-$then statements; ignore those implied by for$-$next loops. $($b$)$ Use the theorem on polynomial orders to find an order for the algorithm segment.

$6.$ for $i$:$=3ton-1$

$a$:$=3*n+2*i-1$

next $i$