Give the array that results after inserting the following sequence of 10 keys into an initially empty linear-probing hash table of capacity 10. key hash V 6. 1 6. 6. Assume that the hash table neither grows nor shrink during these insertions. N GYE ASPHK

how would the hash table look like ? linear probing and quadratic probing ?

What is the worst-case performance of a lookup operation in a hashmap and why? Group of answer choices A- O(1), hashmap always has a constant time lookup, and that is why we like using this associative data structure.   B- O(lg(n)) hashmap has a log(n) lookup because we are able to perform a binary search on the keys because our hashmap always maintains a sorted order of entries added.   C- O(n) because we can have a bad hash function that puts all of our items in the same bucket, thus we would have to iterate through all n items.

Given the input set A = {1, 2, 3, 4, 5} and output set B = {1,  2, 3, 4}, is it possible to find a hash function H from A to B that has no hash collision, i.e.,   LaTeX: \forall ∀ a1, a2 LaTeX: \in ∈A, H(a1) LaTeX: \ne ≠H(a2)   If yes, please give the function. Otherwise, please explain. (Hint: pigeonhole principle)