for k :$=3$ to n

$$for j :$=1$ to $6$n

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

$$next j

next k

$($a$)$

What is the actual number of elementary operations $($additions$,$ subtractions, multiplications, divisions, and comparisons$)$ that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occur within if$-$then statements, and ignore those implied by for$-$next loops. Express your answer in terms of n$.$