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