Give your answer using permutation notation, factorial notation, or other operations. Then evaluate.
How many permutations are there of the letters in each of the following words, if all the letters are used without repetition?
Suppose the expression $a^{2} b^{3} c^{4}$ is rewritten without exponents. In how many distinguishable ways can this be done?