Consider the following algorithm:

//note array is an array, size is the size of the array int Secret(int array, int size){

int x = array[0]; int y = array[0]; int i = 1; while(i

if(array[i] < x){

x = array[i];

}

if(array[i] > y){

y = array[i]; }

}

return y x; }

a.)What does the algorithm compute?

b.)What is the basic operation?

c.)How many times is the basic operation executed? d.)What is the efficiency class of the algorithm?