Please follow the instructions and tell me how you got to that answer just like the instructions say please follow it. Please do all the problems don't do half and submit it to me. Please do all of them. And please type it for me so I can read what you wrote. Please show all of your answers and explain how did you arrive with that answers. Do not just give me the answers. Please explain how you got to that answers. In other words please read the instructions carefully and do it what the instructions said to do. I need help with number 2, letters A,B,C,D,E, and F

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

I need help with number 4,6,7, and 8. Please read the instructions before submitting to me and for all of them please show your answers means how you got to that answer.

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