Question II (15 points): Consider the following algorithm, where the input is an integer .

for(i = 0; i

for(j = i + 1; j

x = x + 2; //Statement 1

}

}

1. (13 points) Determine the number of times Statement 1 gets executed.

2. (2 points) Write the cost of the algorithm using Big O() notation (the tightest upper bound).

I want the solution to be in a table have three columns same table in the picture.

Question II (15 points): Consider the following algorithm, where the input is an integer n. for (i=0;i<>