For each of the following three program fragments: a. Give an analysis of the running time in Big-O.

(5 points each question) For each of the following three program fragments: a. 1. Give an analysis of the running time in Big-o =0; (i=0; (1) Answer: sum for in ; sum = sum + i++){ i; (2) sum0 Answer: for (1-0 ; in ; 1++){ (J-0; j++){ jn; sum - sum + ji for (3) sum -0; for Answer: (1-0 ; for in ; 1++){ jn*n; (j=0; j++){ sum = sum + j