Write c$++$code of hash table using linear resolution. the code should be use template with class and also work for any data type. Please provide all the code for constructor, copy constructor, function overloading, insert$($this will be bool function$),$ search keyvalue $,$ remove and display and also give solution for collision using linear resolution in the insert function. what will happen if the key is not in the table or primary hash function.The output should be in that way: index, key $,$value, and also gove screen shot of that. Also please explanation every function. Provide all the code including main driver.Do not use struct,list, nodepointer, vector. The code only has to by using class template.

Some condition: CANNOT use struct, nodepointer, linked list, any kind of vector, functional. ONLY allow to use to complete this problem only with template class

output:

index key value;