Directed Graphs and Network Flows · Superchallenge problem

By Stanley's theorem, $|P(G,-1)|$ counts the acyclic orientations of $G$. Using $P(K_4,k)=k(k-1)(k-2)(k-3)$, how many acyclic orientations does $K_4$ have?