For a certain race, 3 teams were allowed to enter 3 members each. A team earned 6 – n points whenever one of its members finished in nth place, where 1 ≤ n ≤ 5. There were no ties, disqualifications, or withdrawals. If no team earned more than 6 points, what is the least possible score a team could have earned?

(A) 0

(B) 1

(C) 2

(D) 3

(E) 4

Here's another one from the GMAT Prep Software free tests 1 and 2 so better to wait on this explanation unless you've done those tests already. This is another GMAT puzzle that relies on you being organized. You basically need to make a list of the possibilities keeping track of the constraints with the goal of maximizing the points for two of the teams so the third team has the least possible score. In terms of the zoomed out approach this question reminds of this is other GMAT puzzle: The number 75 can be written as the sum of the squares of 3 different positive integers