In C++

Starting with this code:

const int TABLE_SIZE = 128; class HashMap { private: HashEntry **table; public: HashMap() { table = new HashEntry*[TABLE_SIZE]; for (int i = 0; i < TABLE_SIZE; i++) table[i] = NULL; } int get(int key) { int hash = (key % TABLE_SIZE); while (table[hash] != NULL && table[hash]->getKey() != key) hash = (hash + 1) % TABLE_SIZE; if (table[hash] == NULL) return -1; else return table[hash]->getValue(); } void insert(int value) { /* your code here*/ } ~HashMap() { for (int i = 0; i < TABLE_SIZE; i++) if (table[i] != NULL) delete table[i]; delete[] table; } };

Write your own main and insert function to insert the sequence of integers { 121, 81, 16, 100, 25, 0, 1, 9, 4, 36, 64, 49,) using a table of size 17 then implement your own rehashing algorithm of choice and run the same sequence of input using a table of size 7.