A good hash function shoulda. minimize collisionsb. be fast to computec. distribute entries uniformly throughout the tabled. all of the above

Describe a data structures that supports the stack push and pop operations and a third operation findmin, which returns the smallest element in the data structure, all in o(1) worst-case time.