Determine whether the following problem involves a permutation or a combination and explain your answer. How many different 7-letter passwords can be formed from the letters S, T, U, W, X, Y, and Z if no repetition of letters is allowed? Choose the correct answer below. OA. The problem involves a permutation because the order in which the letters are selected does matter. OB. The problem involves a combination because the order in which the letters are selected does matter. OC. The problem involves a permutation because the order in which the letters are selected does not matter. OD. The problem involves a combination because the order in which the letters are selected does not matter.