Determine the growth function and order of the following code fragment:

What will be an ideal response?

```
for (int count = 0; count < n; count ++)
{
for (int count2 = 0; count2 < n; count2 = count2 * 2)
{
System.out.println(count, count2);
}
}
```
The outer loop will be executed n times. The inner loop will be executed log n times. Therefore, the growth function for the code fragment is n*(log n). That is order n log n.