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. N11 N10 No Ng N6 Ns N4 N3 Ni N2 Select all the statements below which are TRUE: The BST has 5 leaves. O N2 is the node with the maximum key. The predecessor of the node N1o is the node N4. The key of the node N3 is less than the key of the node N The height of the node Ng is 4. The successor of the node N11 is the node N1. The list of nodes in the preorder-tree-walk is N11, N10, Ns, N5, N4, N7, Ng, Ne, N3, N1, N2