9. Insert 8: a. Create a new node with value 8. b. Starting at the root node (2), compare the value of the new node (8) to the value of the current node (2). c. Since 8 is greater than 2, move to the right child (5). d. Since 8 is less than 5, move to the left child. e. Since 8 is less than 6, move to the left child. f. f. Insert 8 as the left child of 6. The final binary search tree should look like this: 2 5 9 6 8 10 12 13 8 Note that this is just an example of one possible binary search tree and the final tree can look different based on the order of elements. Activate Wind