Suggest how to implement a direct-address table in which the keys of stored elements do not need to be distinct and the elements can have satellite data. All three dictionary operations ($INSERT$,$ DELETE$, and $SEARCH$) should run in $\mathcal{O}(1)$ time. (Don’t forget that $DELETE$ takes as an argument a pointer to an object to be deleted, not a key.)