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 you to write the answer in a table such as a picture in the level of the same details notice that there are nested loop

int sum, product; sum =0; product =1; for (int k=1;k<>