please solve all of them and i ll upvote it

Insert numbers B={6. 1. 13, 18} into an empty hash table of size 6. Clearly indicate your hash functions. Show the hash table for all insertions. Q7a) [5 points] Use open addressing and linear probing. What is the number of collisions? Q7b) [7 points] Use open addressing and double hashing. What is the number of collisions? Q7b) [Spts] Suppose we use a hash function h() to hash n distinct keys into an array T of length m=c*n, where c>2 is an integer constant. Assuming simple uniform hashing (i.e. the probability of element i hashing to any slot k is 1/m), show that the expected number of colliding pairs of elements is en/c)