Solution: This requires the Stirling numbers of the second kind $ S(5, 3) $, which count the ways to partition 5 distinguishable objects into 3 non-empty indistinct subsets. Using the recurrence relation: - go-checkin.com