Task: Demonstrate and Explain Why Hash Tables Are Faster Than Arrays for Key-Based Lookup

Task: Demonstrate and Explain Why Hash Tables Are Faster Than Arrays for Key-Based Lookup: a task in Terminal-Lego-15k (Harbor dataset). When searching for an element by a key (not by index), hash tables achieve O(1) average-case lookup while arrays require O(n) linear search. This task asks you…