Insertion and lookup in a balanced binary search trees areguaranteedO(log N), while insertion and lookup in a hashtable is O(1) under ideal conditions.Assume we are adding N keys into a set, implemented using a balanced BST or a hashtable (assume separate chaining). Describetwodifferent scenarios in which the balanced BST would outperform the hashtable.