C++

Consider the following hash table implementation: template int Hashcint>:: ComputeHash(int & val) class Hash { public: return val % size; Hash(int capacity=100); } ~Hash(); int Hash:: ComputeHash(string& val) { bool Search(T& val); int sum = 0; void Insert(T& val); bool Delete (T& val); for (int i=0; i* data; int size; }; int main() { Hash h1(4); Hashcint> h2(5); string s[]={"babab", "aabaaaaa", "bbbb", "ccc", "aaaad", "aaabbaaa"}; template Hash::Hash(int S) { size = S; data = new DLList[size]; } for (int i=0; i void Hash::Insert(T& val) { int index= ComputeHash(val); data[index]. AddToTail(val); return 0; } 5 (7 (a) Draw the two hash tables and their contents after we run the main function. points)