Consider the following
function(n)
{
val=0;
for i=1 to n
{
if(n<=10000)
for j=1 to n
for k=1 to n
val = val + 1;
else
for j=1 to n
val = val + 1;
}
}
The running time of the above function can best be described by $T(n)=$____________
$A)\theta(n^{3}) $ $B)\theta(n^{2})$ $C)\theta(n)$ $D)\theta(1)$