Analyze the following algorithm and give a theoretical upper bound $($worst case$).$ Explain your answer.

myFunc$($int $n)$

sum $=0$

for $i=0$ to $n$; $i++$

for $j=0$ to $n$; $j++$

sum $+=i**j$

print sum