We have a set with n elements. Using universal hashing and hash table of size m we can achieve expected access time O(1 + n/m), but the worst case access time is (n). Using balanced binary search trees, the worst access time is O(log n). Describe a dictionary implementation that achieves the best of two worlds: expected access time 0(1+n/m) and worst-case access time O(logn).