Structures and Introduction to Algorithms - All 7 Consider the following implementation of the Hash and DLL classes: template template class Hash class DNode of private: public DLL data; tion int size: DNode GetNext(): DNode*GetPrev(): T GetValo: DLLExport(T val); public: Hash(int capacity); -Hash(); template bool Search(T & val): class DLL void Insert(T & val); public: bool Delete(T & val); bool IsEmpty0; int ComputeHash(T &val); DNode GetHeadNode(); 3: DNode*Get TailNode(); int Hash int> ComputeHash(int & val) (...) Wassume that you have computeHash function for }; each expected data type Write the implementation of the function DLLExport(int val), which export all elements in the bucket that val belong to(or should belong to) in the current hash table to a single DLL. The original hash table should not be affected. Structures and Introduction to Algorithms - All 7 Consider the following implementation of the Hash and DLL classes: template template class Hash class DNode of private: public DLL data; tion int size: DNode GetNext(): DNode*GetPrev(): T GetValo: DLLExport(T val); public: Hash(int capacity); -Hash(); template bool Search(T & val): class DLL void Insert(T & val); public: bool Delete(T & val); bool IsEmpty0; int ComputeHash(T &val); DNode GetHeadNode(); 3: DNode*Get TailNode(); int Hash int> ComputeHash(int & val) (...) Wassume that you have computeHash function for }; each expected data type Write the implementation of the function DLLExport(int val), which export all elements in the bucket that val belong to(or should belong to) in the current hash table to a single DLL. The original hash table should not be affected