Q1: For each of the following algorithms, indicate A natural size metric for its inputs. Its basic operation. (i) (ii) (ii) Whether the basic operation count can be different for inputs of the same si a. computing the sum of n numbers elhi...:.n... b. computingn! .pradas.c.t. c, finding the largest element in a list of n numbers t. com.pal d. Euclid's algorithm t.wi da.V42an e. sieve of Eratosthenes (Big-Oh). For the following program fragments, give an analysis of the running Program fragments time Proof Running Sum-0 For (j0ji:j++) sum++; 2 2 int i, j, k 0 | for (i=n/2 ; i(#n ; i++) k=k + n / 2