Hello, I am studying data structures and algorithms and I am not sure how to solve this problem? Can anyone please show me how to solve step by step?

thanks in advance

The following definitions enable us to build a resizable hash table that holds strings (no duplicates allowed unsigned int hash (string s) Omitted is the code that produces a number given a string All you need to know is that this number can range from 0 to a large value Someone using that number to index into a hash table must reduce it The usual approach is to use the number modulo the number of buckets Instead of the hash table containing an array of buckets, it contains a pointer to an array of buckets The array is dynamically allocated When the average bucket size gets too high, we can call set Number of Buckets to cause a new array of buckets to be allocated and the strings to be rehashed into the new array, which will replace the old class HashTable public HashTable (unsigned int initialsize 97) Hash Table void insert (string s); void se Buckets (unsigned int newNumberofBuckets) private: unsigned int m number of Buckets list