Can you solve this question?

6. (8 points) (a) (4 points) Consider a hash table with chaining using a hash function that is a good approximation to the simple uniform hashing assumption, and having a load factor a, but instead of using a linked list to handle collisions, we use a binary search tree. Give the expected time to search for a key and explain it. (b) (4 points) Based on that, would using a BST instead of a linked list (in each slot) be better forsearching? Consider load factors a = 0.5 and a = 128. Reason your answer carefully