Consider the binary search tree

Question 1 10 pts Consider the binary search tree (BST) below, where each node has a label. Note that the label is NOT the key. The keys satisfy the BST property. Assume that all the keys are distinct. N14 N2 Select all the statements below which are TRUE N2 is the node with the minimum key. The key of the node N10 is less than the key of the node N12 The predecessor of the node Ng is the node N The height of the BST is 4. The list of nodes in the inorder-tree-walk is N2, Ns, N14, Ne,N3, N3,N12, N4, No, N7, N5, N1, N13,N11 The successor of the node Ng is the node N3 N14 is the node with the maximum key