Directed Graphs and Network Flows · Challenge problem

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