Data structure and algorithmn

A hash table based on separate chaining is implemented as an STL "vector" of STL "forward_list"s, called "hashTable". Each element of the lists is of the type STL "pair" including in the form of <key, value>, where keys are of the generic type of "K" and values are of the generic type of "V". Define a method to rehash the table by doubling the size of the table.