Implement a circular, doubly linked list with a hash table implementation. Dont use header and trailer nodes in the list, as those nodes were supplied only for easy removal of the first and last nodes from a noncircular list; the first and last nodes didnt need to be considered as special cases. In a circular list, there arent any first and last nodes, so this is not a problem. Be careful about the way you insert nodes, so that an exact physical copy of the hash table is made in the copy constructor and overloaded assignment operator.