Consider the code fragment:

for (int k = 1; k < N; k = k*2) sum++;How many addition operations does the above code fragment perform as a function of N?

Which of the following order-of-growth classifications represents the worst case number of array accesses used to binary search an array of size N?

Which of the following order-of-growth classifications represents the best case number of array accesses used to binary search an array of size N?

Which of the following functions is O(N^{3})?

Which of the following functions is big-omega(N lg N)?