3. Insert 5: a. Create a new node with value 5. b. Starting at the root node (2), compare the value of the new node (5) to the value of the current node (2). c. Since 5 is greater than 2, move to the right child. d. Insert 5 as the right child of 2. 4. Insert 9: a. Create a new node with value 9. b. Starting at the root node (2), compare the value of the new node (9) to the value of the current node (2). c. Since 9 is greater than 2, move to the right child (5). d. Since 9 is greater than 5, move to the right child. e. Insert 9 as the right child of 5. 5. Insert 6: a. Create a new node with value 6. b. Starting at the root node (2), compare the value of the new node (6) to the value of the current node (2). c. Since 6 is greater than 2, move to the right child (5). d. Since 6 is less than 5, move to the left child. e. Insert 6 as the left child of 5.