(Too good to be true) (6 points) Your friend claims to have built a new kind of binary search tree with O(1) (deterministic) insertion time (better than the O (log(n)) of red-black trees), which can handle arbitrary comparable objects. How do you know they are wrong