Assume a hash table is implemented using chaining with buckets implemented using binary search trees. What's the average$-$case time complexity of searching for a data item? Assume the size of data, $n,$ is not much larger than the size of the hash table $($e$.$g$.n=2^{**}k)$

$O(n)$

O$(1)$

$O(n^2)$

$O(log(n))$