Assume that you have to store some data values in the most efficient data structure having complexity equals to O(1) and size should be 14. Perform the following operations using hash table making...

Assume that you have to store some data values in the most efficient data structure having complexity equals to O(1) and size should be 14.  Perform the following operations using hash table  making  sure that all the values should never collide with each other. Apply appropriate strategies to avoid collision of values. Compare and contrast the strategies of Linear probing and separate chaining using the given data.

insert(48), insert(50), insert(35), insert(60), find(15), find(48), withdraw(35), delete(50), find(90), insert(64), insert(42), find(32)