Need help with a Design and Analysis of Algorithms question:

For each problem, select a theta notation from among (1), (lg n), (n), O(n lg n), (), 0(n), (2n), or (n!) for the number of times the statement x x + 1 is executed. a. for i=1 to 2n for 1 to n x=x+ 1 for i = 1 to n forj 1 to i for k = 1 to x=x+ 1 while (i 2 1) x=x+ 1 i = i/2 d, J=n while (i > 1 for i= 1 to j =j/3