The set is to be partitioned into three sets of equal size. Thus, . The number of ways to partition is
The three subsets are named, so they are regarded as distinct (labelled) groups.
Step 1: Choose the 4 elements that will go into set .
Number of ways = .
Step 2: From the remaining 8 elements, choose the 4 elements for set .
Number of ways = .
Step 3: The last 4 elements automatically form set , so no further choice is needed.
Total number of partitions:
Multiply the counts from Steps 1 and 2:
Thus, the required number of ways to partition the set into three labelled subsets of equal size is .
Option C which is:
Tagged Distribution and grouping of distinct objects. Machine-assigned, so read it as a strong shortlist rather than a verdict.