If there are n of type 1, n of type 2, and so on, for r different types, then the number of distinguishable permutations is calculated using the following formula. nl n!n2l...n! A shelf stocker at a local grocery store has 2 varieties of brand A frozen dinners, 2 varieties of brand B frozen dinners, and 4 varieties of brand C frozen dinners. Complete parts (a) through (c) below. CONN (a) In how many distinguishable ways can she stock the shelves if the dinners can be arranged in any order? The shelves can be stocked in (Type a whole number.) ways.