Create a hashtable data structure. Hashtable should be implement using chaining. Each hash bucket should have access to the head of a linkedlist. If the size of the likedlist become 11 then it should be replaced by a binary search tree. On the other hand if the size of the binary search tree reduced to 8 then it will be replaced by a linkedlist. Explain what is the advantage of this strategy? Create the rehash function that rehash the hashtable when the loadfactor is increased to a certain threshold. Your hashtable should be a template class written in two files. It should have all the requirements of a good programming practice and a main file should be included with your template files. Creating a template hash table class is the minimum requirement additional implementation details are important and help you to get points.