The problem involves arranging guests around a long table, with specific constraints on which side certain guests can sit. Let's solve the problem step-by-step:
\({}\binom{12}{7} = \frac{12!}{7! \times 5!}\)
\(10!\\)ways for Side A.
\(10!\\)ways for Side B.
The final calculation for arranging all guests is:
\({}\binom{12}{7} \times 10! \times 10! = \frac{12!}{7! \times 5!} \times 10! \times 10!\)
The correct number of ways to seat the guests considering all constraints is:
\({}12! \times \frac{10!}{7!} \times \frac{10!}{5!}\)
Therefore, the correct answer is:
\(12! \times \frac{10!}{7!} \times \frac{10!}{5!}\)
Four teams – Red (R), Blue (B), Green (G), and Yellow (Y) – are competing in the final four rounds of the Inter-School Science Olympiad, labeled Round A, Round B, Round C, and Round D. Each round consists of one match between two teams, and every team plays exactly two matches. No team plays the same opponent more than once.
The final schedule must adhere to the following rules:
(193 words)