Computed Chaining Insertion

Your task is to write a C++ program that stores the given keys according to the computed chaining insertion. But in the form of a simplified version. Each of the given keys must be placed in the index that calculated according to the hash function, but if there is a collision, the collided numbers will be added to a nested list without moving any keys.

You must create computed_chaining.h file with below codes. DO NOT need to any changes. ONLY write your code in comment lines.

hashFunction: To calculate hash of key according to the size of keys.

insert: To push key to list according to the hash of key. print: To show all keys with list in nested list.

You must create main.cpp file with below codes. DO NOT need to any changes. ONLY use for testing your code.

\#include "computed_chaining.h" \#include using namespace std; int main ()\{ int keys[7] = \{19,90,55, 11, 76, 65, 30 }; ComputedChaining chain(7); for(int i=0;i