Which operation will occur most often in this algorithm? Int findMax(int ar[0,1,-,n-1], int n){ int max = ar[0] for(int i = 0; i max) then

Which operation will occur most often in this algorithm?

Int findMax(int ar[0,1,-,n-1], int n){

int max = ar[0]

for(int i = 0; i

if(ar[i]>max) then max = ar[i]

}

return max

}

a) max = ar[0]

b) max = ar[i]

c) i = 0

d) ar[i] > max