Implement a hash table that handles collisions by chaining. You have to use linked lists from the Standard Template Library. You need to implement the insert, search and delete operations. The keys are integers (C++ int type) and you can assume that all keys are non-negative. The rst number in the input will be the size m of the chained hash table. You will use the simple hash function h(k) = k mod m. Then lines will follow starting with i, s, d,o, or e. The details are as follows: Use the hash function h(k) = k mod m. i(key): Insert (key) into the table. For example, i2 implies Insert key 2 into the table. For collisions, insert the colliding key at the beginning of the linked list. You just need to insert the key and dont have to output anything in this case. d(key): delete (key) from the table. For example, d2 implies Delete key 2 from the table. If there are multiple elements of the same key value, delete the element of the key value that appears the earliest in the list. If the delete was successful, you have to output

(key):DELETED; If not (since there was no element with the key value), output

(key):DELETE_FAILED; s(key): search (key) in the table. If there is an element with the key value, then you have to output

(key):FOUND_ATi,j; where i is the hash table index and j is the linked list index. If there are multiple elements with the same key value, choose the rst one appearing in the linked list. If you couldnt nd the key, then output

(key):NOT_FOUND; o: output the table. Output the entire hash table. Each line should begin with the slot/hash table index followed by key values in the linked list. For example, if m = 3 and we inserted 3, 6, and 1 into an empty table in this order, then you should output

0:6->3->; 1:1->; 2:; e: nish your program.