5. Why is the best-case runtime for deletion from a 2-4 tree O(log n) and not O(1)? 6. Can you see a situation in which allowing the insertion of duplicates into a 2-4 tree could cause us some problems