Directed Graphs and Network Flows · Hard problem

Among the four score sequences $(3,2,1,0)$, $(2,2,1,1)$, $(3,3,0,0)$, and $(2,2,2,0)$ proposed for a $4$-team round-robin tournament, how many are actually achievable as the score sequence of SOME tournament on $4$ teams?