Suppose you are given a Hash Table that initially has 6 buckets that handle its collisions with Open Addressing using Linear Probing. The hash table has a load factor of λDefault = 0.83

Assume that this Hash Table has a hash function h(k) = k % N, where k is the number to insert into the hash table and N is the number of buckets in the hash table

Assume you insert the following numbers in this exact order: [24, 86, 58, 75, 14, 91]. After insertion, how would the Hash Table have placed all of its elements?

HINT: Keep in mind the current load factor of the hash table. If λCurrent ≥ λDefault, then the hash table must double its capacity and rehash all of its elements again