Given an array of ints data, where n = data.length, consider the following algorithm:

int sum = 0; numAboveAvg = 0;

for (i = 0; i < n; i++)

{

sum+=data[i];

}

average=(double) sum/n;

for (j = 0; j < n; j++)

{

if (data[j] > average)

{

numAboveAvg++;

}

}

a) determine the formula for the number of operations

b) write the big-O notation for the number of operations