Answer:
c.
Explanation:
I believe that in this scenario, the best option for this data would be a hash table using open addressing with 1,800 entries. Hash tables consume more memory than lists but it makes up for it with much faster response time speeds. This is because hash tables work on a key:value system therefore, the license plate can easily be grabbed from the database extremely quickly by just plugging in the plate number. Doing so will retrieve all of the saved information from that license plate. That is why hash tables have a constant time complexity of O(1)
The data structures that would be most appropriate for this task is; D: a hash table using open addressing with 3,600 entries
A hash table is also called a hash map and is defined as a data structure that implements an associative array abstract data type which is basically a structure that can map keys to values.
A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets onto a platform that the desired value can be found.
From the above definitions of a hash function and looking at the question, we can say that the data structure that would be most appropriate for the given task is a hash table using open addressing with 3,600 entries.
Read more about hash table at; https://brainly.com/question/4478090
