Insert 76, 93, 40, 47, 10, 55 into an empty hash table with M=7

1) Using separation chaining, and draw the final result of the hash table contents

2) Using linear probing without resizing, and draw the final result of the hash table contents.

3) Explain why resizing is a must for hashing with linear probing.

4) With linear probing, if we need to delete an element at table index i, can we simply mark the content of that index to null?