Consider a hash table of size 11 that uses quadratic probing to resolve collisions.

Insert the keys = 12,19,23,30,34,45,59,61 in sequence in the hash table. Draw the table after inserting in the given order and also find the total number of collisions.