1) For the code snippet below, which time complexity is accurate?
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++) {
// do stuff
}
}
Α. $O(n^2)$, $\Omega(n)$, and $\theta(n^2)$
Β. $O(n^2)$, $\Omega(n^2)$, and $\theta(n^2)$
C. $O(nlogn)$, $\Omega(n)$, and $\theta(n)$
D. $O(n^2)$, $\Omega(nlogn)$, and $\theta(n)$
