Directed Graphs and Network Flows · Superchallenge problem

In a round-robin tournament among $6$ teams, every team's score is its number of wins. How many different sorted score sequences can occur, over all possible outcomes of the $\binom{6}{2}=15$ games?