Binary Search Tree
A binary search tree is a binary tree data structure in which each node has at most two children, arranged in such a way that the value of every node in the left subtree is less than or equal to the parent node, and the value of every node in the right subtree is greater than or equal to the parent node.

Insertion of Integers
To generate the given binary search tree, we need to insert the integers in the following order:
- Insert 50 as the root node.
- Insert 15 as the left child of 50.
- Insert 62 as the right child of 50.
- Insert 5 as the left child of 15.
- Insert 20 as the right child of 15.
- Insert 58 as the left child of 62.
- Insert 91 as the right child of 62.
- Insert 3 as the left child of 5.
- Insert 8 as the right child of 5.
- Insert 37 as the right child of 20.
- Insert 60 as the left child of 58.
- Insert 24 as the right child of 20.

Counting Nodes in Subtrees
To count the number of nodes in the left and right subtrees of the root, we need to traverse the tree and count the number of nodes in each subtree. We can do this recursively by starting at the root and counting the number of nodes in the left and right subtrees.

- Starting at the root (50), we count the number of nodes in the left subtree by recursively counting the nodes in the left subtree of 15 (which has 4 nodes) and the nodes in the left subtree of 5 (which has 2 nodes). So the total number of nodes in the left subtree is 4 + 2 + 1 = 7.
- We count the number of nodes in the right subtree by recursively counting the nodes in the right subtree of 62 (which has 3 nodes) and the nodes in the right subtree of 91 (which has 1 node). So the total number of nodes in the right subtree is 3 + 1 + 1 = 5.
- Therefore, the answer is (7, 4), which is option B.

Conclusion
In summary, a binary search tree is a binary tree data structure in which each node has at most two children, arranged in such a way that the value of every node in the left subtree is less than or equal to the parent node, and the value of every node in the right subtree is greater than or equal to the parent node. To count the number of nodes in the left and right subtrees of the root, we need to traverse the tree and count the number of nodes in each subtree recursively.

B