PRACTICE ANOTHER

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]$

next $j$

next $k$

"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 segment is $r,$