Find the Big$-$ Time Complexity notations for the following pseudocode programs with regard to n $($the size of data$).$ Please note, you must show us the steps on how to find both the upper bound and the lower bound using the definition equations of Big O and Big Omega by design, or you will get zero points.

You may use the limit trick and the pull$-$up$/$pull$-$down tricks from the lectures for your convenience.

A$.$

$//$ Assume n is always larger than $10$

for $($i $=1$; i $<=$ n; i$++)\{$

for $($j $=1$; j $<=$ n; j$++)\{$

if j $>10$ then $\{$

$//$ code block that takes a constant amount of runtime C

$\}$

$\}$

$\}$

B$.$

$//$ Assume n is always larger than $10$

for $($i $=1$; i $<=$ n; i$++)\{$

for $($j $=1$; j $<=$ n; j$++)\{$

if j $<=10$ then $\{$

$//$ code block that takes a constant amount of runtime C

$\}$

$\}$

$\}$