Consider a hash table with size = 11, hash function h (key) = key %11; Collisions are resolved using linear probing. Following operations are performed sequentially:

Insert(21);

Insert(57);

Insert(37);

Insert(16);

Insert(48);

Insert(17);

Insert(27);

Insert(30);

Insert(54);

Insert(34);

Insert(24);

Now push all elements starting from top of the hash table to the end onto a stack s. Now if the following code is executed,

for(int i = 0; i < 11; i++)

{

a = pop(s);

}

Then the final value of a is____________

NOTE: Index 10 of hash table is treated as it's top