Please zoom in if you have trouble readding the question. Thank You

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. Select all the statements below which are TRUE: The height of the BST is 4. The successor of the node N_9 is the node N_3. The key of the node N_1 is less than the key of the node N_9. The list of nodes in the inorder-tree-walk is N_5, N_8, N_4, N_10, N_7, N_11, N_9, N_6, N_3, N_1, N_2. N_6 is the node with the maximum key. The predecessor of the node N_9 is the node N_11. The height of the node N_7 is 1