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 12 14 N11 N13 10 Select all the statements below which are TRUE: The predecessor of the node No is the node N14 The key of the node N10 is less than the key of the node N12 The list of nodes in the inorder-tree-walk is N2, Ng, N14, N6, No, N3, N12, N4, N10, N7, N5, N1, N13, N1 O The height of the BST is 4 N2 is the node with the minimum key N14 is the node with the maximum key The successor of the node No is the node N3