Describe the order of growth of each of the following code sections, using the big O notation: count = 0; value N; value N(N - 1); count = count + value; value = 1; count = 0; while (value = 0) { value--: count++; }