P2. (30 pts) for the following code segments, give the worst-case running time using the Big...

    

Transcribed Image Text:

P2. (30 pts) for the following code segments, give the worst-case running time using the Big - O notation by constructing the function T(n). Show your work. a. Code-1 T(n) = int i, j, k = 0; for (i = n/2; i T(n) = some operation; k=k+i; i++; P2. (30 pts) for the following code segments, give the worst-case running time using the Big - O notation by constructing the function T(n). Show your work. a. Code-1 T(n) = int i, j, k = 0; for (i = n/2; i T(n) = some operation; k=k+i; i++;