1. “Hash Table” is an effective data structure for implementing dictionaries. What is a hash table and how does it work?
(A) A hash table is a data structure that uses a hash function to map keys to values, allowing for fast retrieval of data.
(B) A hash table is a data structure that stores data in a sorted manner for fast searching.
(C) A hash table is a data structure that allows for efficient sorting of data.
(D) A hash table is a data structure that stores data in a hierarchical manner for fast searching.
(E) None of the above.