this is all one question

Problem 3: Poultry Eaters Chew Awful Nuggets (20+ pts) Some of the following statements are True; others, woefully, are False. Your job is to put a dark circle around True or False as appropriate. You will receive two points for each correct action. Zero points for a blank answer. For False statemente you can disprove it using either a counter example or another type of proof for up to 2 more points. Merely explaining why it is False will earn one more point. Pictures often make excellent counter examples. Unless otherwise statedthe letter n represents the number of nodes or keys in the structure, as appropriate for the question. 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. True False 3D. A minimum of one rotation (single or double) is required to restore the AVL property after deletion of a single key. True False 3E. The number of empty child pointers in a leaf of a 2-3 tree is one more than that of a leaf in a binary tree. True False 3F. A 2-3 tree with an internal nodes has exactly (2n +1) leaves. True False 3G. An internal node in a k-ary tree has at least one non-empty child subtree. True False 3H. The AVL tree resulting from deletion of a single key is unique. True False 31. A valid (2-3) tree with 2 keys and 2 levels exists. True False 3J. The asymptotic complexity of an unsuccessful search in a red-black tree is the same as that for an AA tree