element hash table (first index starts at “0”) and our Hash function is
H(key)=key % tablesize;
But now, suppose we want to insert an item with Key=45 but there is a
collision when we attempt the initial insertion. What are the next
four (4) locations we will try (assuming they also have collisions) if we
are using Quadratic Probing?