I have this question from here: Link for the exercise
It is the question number 4a. I am also aware that a question was posted on MSE about the exact same exercise over here How many ternary strings of length 4 have exactly one 1?
But my solution is different from both of them. I reason in such way: once there is a $1$ in the string, there are $2^3$ possibilities for the rest of the string. Now, in both answers, the reasoning goes on counting only the positions of where $1$ can go, yet I reason that it's important to see where the other letters go. As for example: $0123$ and $0132$ are different words and should be taken into account as two separate cases. Thus I reasoned I should count the total number of string not equal to $2^3 * 4$ or $2^3 *3$ but to $2^3 * 4!$.
Am I wrong or correct?