(Solved): Problem: Hashing Hashing is a technique to convert a range of key values into a range of indexes of ...

Problem: Hashing Hashing is a technique to convert a range of key values into a range of indexes of an array. Load Factor is a measure of how full the hash table is allowed to get before its capacity is automatically increased which may cause a collision. When collision occurs, there are two simple solutions: Chaining and Linear Probe. In what order could the elements have been added using the output below and given the following hash table implemented using linear probing. Note the following: 1. The hash function used is the identity function, $h(x)=x$. 2. Assume that the hash table has never been resized, and no elements have been deleted yet. 3. There are several correct answers 4. Show all workings