Big O notation from a for loop

Question

I encounter this problem in my discrete mathematics class. At first glance, I thought that the answer would be O($2^{(n^{302})}$), since t multiplies 2 every time in the for loop. However the correct answer is O($n^{302}$). I don't know why it work this way.

enter image description here

Edit: Sorry, please click the image URL.