1. The hash function

   is used to insert the keys

   61, 62, 63, 64, and 65

   Into a hash table of size m = 1000. The order of the hash codes in the table are given by

   625, 125, 0, 750, 875 625, 750, 625, 125, 0 625,125, 0, 875, 750 625, 750, 875, 0, 125 625, 750, 125, 875, 0

2. 1. Which of the following list(s) is (are) not max-heap based on MaxHeapify algorithm?

   Left(i)

   return i*2

   Right(i)

   return i*2 + 1

   MaxHeapify(int[] A, int i){

   l = Left(i);

   r = Right(i);

   largest = Integer.MIN_VALUE;

   if((l A[i]))

   largest = l;

   else

   largest = i;

   if((r A[largest]))

   largest = r;

   if (largest != i){

   swap A[largest] with A[i]

   maxHeapify(A, largest);

   }

   }

   A = {23, 17, 14, 16, 12, 10, 13, 11, 15} A = {56, 45, 20, 44, 30, 10, 15, 39, 40} A = {56, 23, 50, 20, 18, 45, 49, 19, 17} A = {58, 30, 48, 25, 18, 45, 49, 19, 17} None of the above