Consider the following algorithm segment. Assume that $n$ is a positive integer such that $n5.$

for $k$:$=4ton$

for $j$:$=1to6n$

$x$:$=a[k]-b[j]$

nextj

next $k$

$($a$)$ What is the actual number of elementary operations $($additions$,$ subtractions, multiplications, divisions, and only comparisons that occur within if$-$then statements, and ignore those implied by for$-$next loops. Express y "Read It$"$ link.$)$

The number of operations is

$($b$)$ Apply the theorem on polynomial orders to the expression in part $($a$)$ to find that an order for the algorithm