Algorithm question

2. (10 pts) Consider a chaining hash table A with b slots that holds data from a fixed, finite universe U. (a) (3 pts) State the simple uniform hashing assumption. (b) (7 pts) Consider the worst case analysis of hash tables. Suppose we start with an empty hash table, A. A collision occurs when an element is hashed into a slot where there is another element already. Assume that |U| represents the size of the universe and b represents the number of slots in the hash table. Let us assume that |U|