They are asking to convert Complete Undirected graph into Directed graph without cycle by choosing direction for the edges.
See this $K_{3}$ graph-
(Image ref)
By this time you must have got Problem statement meaning. Your resultant graph should be acyclic.
Lets say you have a complete graph $G$ which has $n$ vertices, $v_1, v_2,\dots v_n$. To convert it into the resultant graph we have to assign direction to each edge. Now see, our resultant graph is acyclic therefore it must have topological order.
(I have not drawn all edges except $V_1$ edges.)
here every rearrangement of vertices in topological sort leads to one particular combination to choose the direction of edges.
Hence - $n!$ is answer.
Just to illustrate more, see one of the permutation out of $n!$
These two permutation shows that undirected edge between $V_1$ and $V_2$, was first chosen as $V_1 \rightarrow V_2$ and then $V_2 \rightarrow V_1$
Don't think about the labeling of vertices, If I do unlabelling of all $n!$ permutations then all structures are same. But it doesn't matter If I am arriving at the same structure, What matters is, In how many ways I can reach to that.
See this-
All these structures are Isomorphic...But still, there are $3!$ ways to reach such structure.
C.