You are given the following algorithm. The overall time complexity expressed in Big$-$O for the code representing this algorithm is O$($n$2).$

a $=5$

total $=0$

for i in the$\_$list:

for j in the$\_$list:

print$($i$)$

print$($j$)$

for k in the$\_$list:

total $+=1$

Group of answer choices

True

False