If the rank matters, we should use the permutation formula. The formula is nPk = n! / (n-k)!
  
 Where n is the total number of people where k is how many people in must be in each group.
 So in the problem n would be 11 and k would be 6.
 nPk = n! divided by (n-k)!
 = 11! Divided by 5!
 = 332640
 There are 332640 ways that the members of the cabinet can be appointed.