6. Say you are given a hash table size of M 1123 and we insert keys into the table where collisions are resolved with linear probing. Assume we are using a good hash function that effectively hashes to a random cell ave probes/miss-= 1 + - (a) (2p inte) w.an probm/hit-2(,+)-prob--! (a) (2 points) What is the highest number of keys N I can put in the table if I want the average number of probes on a miss to be 18? (b) (2 points) How about 8