5:14 E Question 1. III [4 points) Let p and q be two positive integers such that p =p; i--). Question 2. [6 points] Do a line-by-line analysis to find the running time of the fragment given in the following algorithm. Assume that the cost of the statement in line (i) is c; for i=1,2,3,4. begin algorithm (1) sum = 0; (2) for (i=log n; i>=1; i--) (3) for (j=n; j>1;j/=2) (4) sum+=array[i][j]; end algorithm