a. What's the running time of Hash Table Search for collision resolution by chaining? Express your answer in asymptotic notation. Use the standard notation introduced in class where $n$ is number of keys and $N$ is number of slots.

b. What's the running time of Hash Table Search for collision resolution by open-addressing? Express your answer in asymptotic notation. Use the standard notation introduced in class where $n$ is number of keys and $N$ is number of slots.