A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24, 49 The number of nodes in the left subtree and right subtree of the root respectively is a. (8, 4) b. (4, 7) c. (7, 4) d. (4, 8)

To answer this question, we need to understand how a binary search tree (BST) works. In a BST, all nodes to the left of a node have values less than the node, and all nodes to the right have values greater than the node.

Let's insert the integers one by one into the BST:

1. Start with the root: 50
2. 15 is less than 50, so it goes to the left of 50.
3. 62 is greater than 50, so it goes to the right of 50.
4. 5 is less than 50 and 15, so it goes to the left of 15.
5. 20 is less than 50 but greater than 15, so it goes to the right of 15.
6. 58 is greater than 50 but less than 62, so it goes to the left of 62.
7. 91 is greater than 50 and 62, so it goes to the right of 62.
8. 3 is less than 50, 15, and 5, so it goes to the left of 5.
9. 8 is less than 50 and 15 but greater than 5, so it goes to the right of 5.
10. 37 is less than 50 but greater than 15, so it goes to the right of 20.
11. 60 is greater than 50 but less than 62, so it goes to the right of 58.
12. 24 is less than 50 but greater than 15, so it goes to the right of 20.
13. 49 is less than 50 but greater than 15, so it goes to the right of 37.

Now, let's count the nodes in the left and right subtrees of the root (50):

• Left subtree: 15, 5, 20, 3, 8, 37, 24, 49 (8 nodes)
• Right subtree: 62, 58, 91, 60 (4 nodes)

So, the answer is (8, 4), which corresponds to option a.