hello everyone, can anyone help with this question please, i tried to solve it but i'm facing some troubles?

I need it as soon as possible please

Use the class hashT as described in the section, Hashing: Implementation Using Quadratic Probing, which uses quadratic probing to resolve collision, to create a hash table to keep track of each states information. Use the states name as the key to determine the hash address. You may assume that a states name is a string of no more than 15 characters. Test your program by searching for and removing certain states from the hash table. You may use the following hash function to determine the hash address of an item: int hashFunc(string name) { int i, sum; int len; i = 0; sum = 0; len = name.length(); for (int k = 0; k < 15 - len; k++) name = name + ' '; //increase the length of the name //to 15 characters for (int k = 0; k < 5; k++) { sum = sum + static_cast(name[i]) * 128 * 128 + static_cast(name[i + 1]) * 128 + static_cast(name[i + 2]); i = i + 3; } return sum % HTSize; }

and thank you in advance