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

for (int count=0; count < n; count++){

for (int count2=0; count2 < n; count2=count2+2) {

System.out.println(count + ", " + count2); }

}