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

2.
a) O(size)
b) O(size)

Gladden do whole the bearings. Do referable do half and propose it to me. Gladden do whole of them. Coercion whole the interrogations gladden emblem the rejoinders so I can distinguish what you wrote.

I scarcity aid with interrogation mix 2, Learning A,B,C,D,E, and F

I scarcity aid with interrogation mix 2, Learning A,B,C,D,E, and F

This is segregate of mix 2. I scarcity aid with learning G,H,I,J,K, and L

I scarcity aid with interrogation 4, learning A, and B and interrogation 8, learning A,B and C

CTS-277 Postulates Structures and Algor i thms Review: Analysis of Algorithms 1. One method to segregateicularize the attempt hasten of an algorithm is to appliance it in a programming speech, enact the program, and straighthabit estimate the explicit season it takes to full. Briefly decipher the feasible bearing(s) with this bearing. 2 Coercion each of the coercionthcoming sequence segments: -authenticate the statoments that are “mice” – authenticate the Big-o run-season (illusion how you arrived at the rejoinder) incorporate sqr o coercion ( ct 0; ct 《 largeness: ++ ct ) , incorporate-sar += postulates [ct] * postulates [ct]; average sqr incorporate_sqr largeness: b.1 incorporate=0; coercion( ct 1: ct largenessi ++ct incorporate += ct; issue = 1 ; coercion( ct = 1; ct 《= largeness; ++ct ) issue ct: contrariety = issue – incorporate; C. i max = postulatesto, o); coercion( ctr = 0; ctr : n; ++ctr ) coercion( ctc = 0: ctc

2.

a) O(size)

b) O(size)

c) O(n^2)

d) O(1)

e) O(n)

f) O(n^2)

g) O(size)

h) O(size^2)

i) O(size)

j) O(n^2)

k) O(n)

l) O(n^2)

4.

a) O(n)

0.004 seconds at n=200

coercion n=4000; expected season = 0.004 * 20 = 0.08 seconds

b) O(n^2)

0.004 seconds at n=200

coercion n = 4000; expected season = 0.004 *4000* 4000/ 40000 = 0.004*400 = 1.6 seconds

8.

a) O(n)

b) O(n^2)

c) O(n)