Consider the following pseudo code:

while N > 0:

for i from 1 to N:

count++

end for

N = N-5

end while

a) What is the worst-case runtime of the pseudocode?

b) What is the value of count after the pseudocode executes? For simplification, you can assume that N is originally a multiple of 5.

A. O(1) B. OologN) C. O(N) D. O(NlogN) E. None of the above. A. 2N 5 B. 5N-1 4 mo w C. 11N Ne + TIN D. N2 10 E. None of the above. + IS