Determine whether the following problem involves a permutation or a combination and explain your answer. How many different -letter passwords can be formed from the letters , , , , , , and if no repetition of letters is allowed? Choose the correct answer below. A. The problem involves a permutation because the order in which the letters are selected does matter. B. The problem involves a combination because the order in which the letters are selected does not matter. C. The problem involves a combination because the order in which the letters are selected does matter. D. The problem involves a permutation because the order in which the letters are selected does not matter.