Write c$++$ code for hash table by creating overflow area to resolve collision using linear method. You need to use stack implementation code for finding overflow area through linked list. In add function,The table will be $4$ column. One is for array index of table size, one for key, one for value, one link$($collision value$).$ If ther is no collision, the link column will be indicate $-1,.$ Otherwise, the link column will indicate the array index of overflow area where the collision key value pair will be move. For the remove function, it will remove from hash table. If there is a collision$($link$)$ value in the indicate remove key value table, after removing key value pair from hash table, the link key value from overflow area will be move to the removed key value index in hash table. the table will use template hash table and in the main cpp driver $,$ it should work for both $($int$,$ int$)$ and $($char$,$ char$)$ dataType. Please do not use vector, any string, cstdlib, cassert. Make it simply and understandable.

Use stack in hash table implementaion file for overflow region when hash table is full.

please also provide explantion.