Determine whether the following problem involves a permutation or a combination and explain your answer. How many different 2-letter passwords can be formed from the letters H, |, J, K, L, M, and N if no repetition of letters is allowed? Choose the correct answer below. The problem involves a permutation because the order in which the letters are selected does matter. {:1- A. -::;j:- B. The problem involves a combination because the order in which the letters are selected does matter. {:1- C. The problem involves a combination because the order in which the letters are selected does not matter. {:1- D. The problem involves a permutation because the order in which the letters are selected does not matter