From the following "pseudocodes", I have to determine how many times each statement

x <-- x + 1 is executed and explain why, from the following options:

O(1), O(log(n)), O(n), O(n*log(n)), O(n^2), O(n^3), O(2^n), or O(n!)

The pseudocode is the following (I don't recall how to do the indentations, but I think its just the "code" thing).

Code:

a.)
for i <-- 1 to n
for j <-- 1 to n
for k <-- 1 to i
x <-- x + 1
next k
next j
next i

Code:

b.)
i <-- n
while i >= 1
for j <-- 1 to n
x <-- x + 1
next j
i <-- [i/2] (square brackets without horizontal line at "top")
end while

Code:

c.)
i <-- 2
while i < n
i <-- i^2
x <-- x + 1
end while

Code:

d.)
i <-- n
while i >= 1
for j <-- 1 to i
x <-- x + 1
next j
i <-- [i/3] (square brackets without horizontal line at "top")
end while

*EDIT*

Yay, [code] worked.