Question VII (15 points): Given the code segment below and that n and x are the input, answer the following questions:

// . . .

int sum = 0;

for(int i = 1; i < n; i = i + 2) sum++; // statement1

if(x < 5){

for(int i = 1; i <= n; i = i * 2) for( int k = 1; k <= i; k = k + 1) sum++; // statement2

}

else{

for(int i = 1; i <= n * n; i = i * 4) sum++; // statement3

}

for(int i = 1; i < n; i++) for( int k = 1; k <= n; k = k * 2) sum++; // statement4

(13 points) Find the number of times statement1, statement2, statement3 and statement4 get executed, showing all the details of your solution, if

x = 0

x = 10

(1 points) Determine the Big-O complexity of this program fragment in the best case.

(1 points) Determine the Big-O complexity of this program fragment in the worst case.