Question

Give a big-O estimate for the number of operations (where an operation is an addition or a
multiplication) used in this segment of an algorithm.
1:=0
for i = 1 to 3
for j 1 to 4
A. O(1)
B. O(n)
C. O(n log n)
D. O(n)