Suppose that your implementation of a particular algorithm appears in Python as:

for i in range$(1,$ n$+1)$:

for j in range$($n$)$:

for k in range$(1,10)$:

This code shows only the repetition in the algorithm, not the computations that occur within the loops. These computations, however, are independent of n$.$ What is the Big$-$O of the algorithm?

Group of answer choices

O$($n$)$

O$($n$2)$

O$($n$3)$

O$($n log n$)$