Answer TRUE or FALSE.
The list is an efficient data structure to use to implement a dictionary because we can make both of the key operations (insert and search) efficient.
A sorted, array-based list allows for fast search.
An unsorted list allows for fast insert.
But you can't do both at once with a list.