12. (4\%) Which of the following statements regarding tries is(are) incorrect? (A)Patricia outperforms digital search trees in terms of storage overhead. (The storage overhead denotes the complexity of the total number of nodes in both data structures.) (B) There is a bitti field associated with any internal node in a compressed trie. (C) A header node exists in Patricia. (D) There is only one type of node data structures in Patricia. (E) The header node in Patricia points to two children nodes. (A) (B) (C) (D) (E) 13. (5%) Which of the following statement(s) is(are) incorrect? (A) Retrieving (reading) the maximum key takes O(1) time in an Min-Max heap. (B) An min-max heap is an m-way search tree. (C) Consider a node N that has a grandparent P. The key of P's left child is greater than N's key in a symmetric min-max heap. (Suppose that keys are not identical in the heap.) (D) Traverse a symmetric min-max heap with BFS, resulting in [null, 4, 80,8,6,96, 40, 12, 20, 10, 16, 14,30] (A) (B) (C) (D)