Answer: 210
Step-by-step explanation:
Given: total locations = 7
Number of locations wishes to rank = 3
If order of selection matters, then the number of permutations of r things from n= [tex]\dfrac{n!}{(n-r)!}[/tex]
The number of ways to rank 3 locations out of 7 [tex]=\dfrac{7!}{(7-3)!}=7\times6\times5=210[/tex]
Hence, the number of different ways required = 210