Answer:
There are 1716 ways the three positions can be filled by these applicants.
Step-by-step explanation:
Permutation is the number of arrangement of <em>k</em> items from <em>n</em> distinct items.
For example, permutation can be used to compute the number of ways to arrange 4 mathematics books together when arranging all the 7 books on a shelf.
In this case there are 3 available nursing positions to be filled.
A total of 13 candidates are qualified for all the three positions.
Then the number of ways the 3 positions can be filled by the 13 candidates can be determine using permutation.
Compute the possible number of selections as follows:
Thus, there are 1716 ways the three positions can be filled by these applicants.