.
In 12*11*10*9*8 = 95040 different ways.
Any of 12 applicants can occupy first position.
Any of remaining 11 applicants can occupy second position.
. . . and so on . . .
Solved and explained.
--------------
This problem is on PERMUTATIONS.
On Permutations, see introductory lessons
- Introduction to Permutations
- PROOF of the formula on the number of Permutations
- Simple and simplest problems on permutations
- Special type permutations problems
- Problems on Permutations with restrictions
- OVERVIEW of lessons on Permutations and Combinations
in this site.
Also, you have this free of charge online textbook in ALGEBRA-II in this site
- ALGEBRA-II - YOUR ONLINE TEXTBOOK.
The referred lessons are the part of this online textbook under the topic "Combinatorics: Combinations and permutations".
Save the link to this textbook together with its description
Free of charge online textbook in ALGEBRA-II
https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson
into your archive and use when it is needed.