Let us consider the following binary tree, called T. We assume that A = 12, B = 15, C = 18 10 B Select all that apply: a. B is a Min heap and a new node should be added as the right child of A b. B is a binary search tree and a new node should be added as the right child of A c. B is a binary search tree and a delete will result in removing node C d. B is a Min heap and a deletemin will result in removing node C