Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
In a group of 3 girls and 4 boys, there are two boys $B_1$ and $B_2$. The number of ways, in which these girls and boys can stand in a queue such that all the girls stand together, all the boys stand together, but $B_1$ and $B_2$ are not adjacent to each other, is :
Step 1: Treat the three girls as one block and the four boys as another. The two blocks can be ordered in 2 ways; the girls can be arranged in 3! ways and the boys in 4! ways.
Step 2: Within the boys’ block, B₁ and B₂ are adjacent in 2·3! arrangements (treat them as one pair). Thus they are nonadjacent in 4!−2·3!=12 arrangements.
Step 3: The total is 2·3!·12=144, option D.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.