My newly developed algorithm has a nested loop in the "set up$/$initialization$"$ phase that must be done for all runs of the algorithm. The inner loop of this setup is a WHILE loop that runs at most n$2$ times and the outer loop of this setup is a WHILE loop that runs at most n times. What true statement can I make about the overall running time of the algorithm. It is$...$

Question $5$ options:

a$)$

$\backslash$Omega $(1)$

b$)$

$\backslash$theta $($n$3)$

c$)$

O$($n$3)$

d$)$

$\backslash$Omega $($n$3)$