ANSWER QUESTION 1 AND 4 AND EXPLAIN WELL PLEASE

Q1. You are asked to compare two proposed algorithms for sorting an array of integers. (a) What measures would you consider using as a basis for comparing the two sorting algorithms and why? (10) (b) Explain the terms best case', 'worst case' and 'average case' and how the terms help compare performance of the two algorithms, specifically using the run-time measure. (15) Q2. Compute the t(n) for the following code fragment. (25) (hint: calculate the number dominant operation) 1: sum1 = 0; 2: for (k=1; k