Using the Fundamental Counting Principle and the formula for permutation, show how to find the number of ways of choosing three initials from the alphabet if tge letters should not be repeated.
pls. someone answer this, rush kasi toh
