1Hardgeneral⏱ 45sWhy does a hash table provide average O(1) lookup time, and what causes worst-case degradation to O(n)?📎▼AHash tables always guarantee O(1) with no exceptionsBA good hash function distributes keys uniformly across buckets giving O(1) average case, but many keys colliding into the same bucket (e.g. from a poor hash function or adversarial input) degrades lookup to O(n) in that bucketCHash tables never have collisions by designDWorst case only occurs when the table is empty