Question

Give the most compact theta notation for the number of times the statement
x = x + 1 is executed in the following pseudo-code:
for i = 1 to i = 3n − 1{
for j = 1 to j = n{
x = x + 1
}
}