Let

n $>1.$

Consider the following pseudocode segment.

for

i is in $\{1,2,,10\}$

do

statementA

for

j is in $\{1,2,,$ n$\}$

do

statementB

for

k is in $\{1,2,3,4\}$

do

for

l is in $\{1,2,,$ n$\}$

do

statementC

$($a$)$ Which statement gets executed the most number of times?