Question 28 Not yet answered Consider the following binary tree. Recall that the following two properties: (Binary Search Tree Property) for each node u in the tree, all the values in u's left subtree are less than u's value, and all the values in u's right subtree are greater than u. (Heap Property) for each node u in the tree, u's value/priority is less than that of its children. (Equivalently, for each node u in the tree, u's value/priority is greater than that of its parent.) Marked out of 1.00 Flag question 10 Select the appropriate choice below. Select one: O a. This tree is a heap but not a binary search tree (where we consider the values as priorities for the heap property, values for the BST property.) O b. This tree is neither a binary search tree, nor a heap (where we consider the values as priorities for the heap property, values for the BST property.) O c. This tree is a binary search tree but not a heap (where we consider the values as priorities for the heap property, values for the BST property.) O d. This tree is both a binary search tree and a heap (where we consider the values as priorities for the heap property, values for the BST property.)