ok, so i'm having trouble with the following problem, so if anyone could help, i'd be grateful. i think that there's some kind of permutation needed for this (meaning n choose k), but i'm confused about how to use it.
A bowling team has 11 adults and 7 children. One night, they decide to divide themselves into 3 teams. The first will have 3 adults and 3 children. The second will have 4 adults and 2 children. The third will also have 4 adults and 2 children. In how many ways can the three teams be chosen?