Consider the following pseudocode fragment: count= 0 for i 1 to 3 for j = i+1 to 4 count= count + i - j end-for end-for 1) when i 2, how many times does the inner loop iterate? correct 2 2 check show answer the initial value of j is i+1. the final value ofj is 4. j = 3, 4. 2 iterations. 2) how many times is the variable count increased? correct 6 6 check show answer 2,3,4. when i= 2,j 3, 4. when i 3, j = 4. when i 1, a total of 6 iterations. 3) what is the final value of count? incorrect 12 the sum is over i x j, for every possible combination of i e (1,2, 3 and je 1, 2, 3, 4}, where i