Write a program in C or C++ to implement a hash table with m = 13 and hash function:

h(k) = k mod m

Initially store the following numbers in the hash table: 20, 75, 315, 101, 7, 545, 213, 67.

Then perform the following sequence of insert and delete operations:

Delete: 213

Insert: 135

Delete: 20, 75, 7

Insert: 71

Delete: 135

Now search the following two numbers in the hash table: 135, 315. Then display the final content of the hash table.