Answer TRUE or FALSE.
The problem with using a list to implement a dictionary is that, while search or insert can be implemented efficiently, deletion cannot.
A sorted, array-based list allows for fast search.
An unsorted list allows for fast insert.
But you can't do both at once.
And none of the list combinations allows for fast delete.