5. (10%) We have an Red-Black tree in the following. Suppose in our implementation the deleted value of node p is replaced with the largest one in p's left subtree. Please fill in the blanks for corresponding operations. Note that (1) the following operations (A), (B), (C), (D) and (E) are performed, independently. (2) By index k of node p, we mean p is the k-th visited node, excluding external nodes, using the preorder traversal. (A) insert 36 index 12 : (Red/Black?, value?) (B) delete 5 index 5 : (Red/Black?, value?) (C) delete 7 index 2 : (Red/Black?, value?) (D) insert 9 index 7: (Red/Black? value?) (E) delete 40 index 7: (Red/Black?, value?)