I got this question , it is a theory question on Big 0

1-if n is 2 what is the final value for counter

2-if n is 5 what is the final value for counter

3-in light of this derive a expression for the number of times the inner loop will run in terms of n

4- state the Big O complexity

int counter =0

for (int i = n; i <=3*n; i ++){

while(i >+n){

i --:

counter ++

}

}

can anyone tell me how to get the values for counter