Assume we use the Open-Addressing Hashing method with 31 element hash table (first index starts at "0") and our Hash function is explained as:
H(key)=key % tablesize;
But now, assume we wish to insert the item with Key=45 but there is collision when we try the initial insertion. Write down the next four (4) locations we will attempt (suppose they also have collisions) if we are using Quadratic Probing?