Directed Graphs and Network Flows · Challenge problem

Teams $1,2,3,4,5$ play a round robin ($10$ games total). Among all $2^{10}$ ways the games could be decided, in how many does the sorted list of the five teams' win totals come out to exactly $1,1,2,3,3$?