Describe the order of growth for the following code section. For the code section, clearly indicate the number of times the loop(s) runs and then express the overall efficiency using big-O notation.

d) value = n; count = 0; while (value > 1) { value value count++; } = 2