Which is true about the time performance of hash tables? Assume a pretty-good hash function and a table that is not overloaded. Get and put operations are about O(n), about the same as a sorted list Get, put, and remove operations could normally expected to be around 0(1), much better than an unsorted list O An unsorted list could be faster if the unsorted list has a low load factor (lambda