True False 3A. All full 3-ary trees have the leaves at the same level. True False 3B. A single find key operation in an AVL tree has the same asymptotic complexity as it does in a red-black tree. True False 3C. The (2-3) tree associated with a set of keys is unique regardless of the order in which the keys are inserted