A hash table in which collisions are resolved by chaining, under the assumption of simple uniform hashing: O A successful search takes average-case time (1) and an unsuccessful search takes average-case time (1 + a). O A successful search takes average-case time (1 + a) and an unsuccessful search takes average-case time (1). O A successful search takes average-case time (1 + Iga) and an unsuccessful search takes average-case time (1). O A successful search takes average-case time (1 + a) and an unsuccessful search takes average-case time (1 + a)