Please do all the problems. Do not do half and submit it to me. Please do all of them. For all the questions please type the answers so I can see what you wrote. I need help with question number 2, Letters A,B,C,D,E, and F

This is part of number 2. I need help with letters G,H,I,J,K, and L

I need help with question 4, letters A, and B and question 8, letters A,B and C

CTS-277 Data Structures and Algor i thms Review: Analysis of Algorithms 1. One way to determine the execution speed of an algorithm is to implement it in a programming language, execute the program, and directly measure the actual time it takes to complete. Briefly explain the possible problem(s) with this approach. 2 For each of the following code segments: -identify the statoments that are "mice" - identify the Big-o run-time (show how you arrived at the answer) sum sqr o for ( ct 0; ct size: ++ ct ) , sum-sar += data [ct] * data [ct]; mean sqr sum_sqr size: b.1 sum=0; for( ct 1: ct sizei ++ct sum += ct; product = 1 ; for( ct = 1; ct = size; ++ct ) product ct: difference = product - sum; C. i max = datato, o); for( ctr = 0; ctr : n; ++ctr ) for( ctc = 0: ctc