What is the run-time complexity in terms of Big O and Big Theta for the following pseudocode?

7) num=0;

for (i = 0; i

for (j = 0; j< i * i; j++)

num = 2*num;