Using the arrangements formula, there are 6 routes to visit the cities, given as follows:
C - H - P, C - P - H, P - C - H, P - H - C, H - P - C, H - C - P.
The number of possible arrangements of n elements is given by the factorial of n, that is:
[tex]A_n = n![/tex]
In this problem, there are 3 cities, hence the number of routes is given by:
[tex]A_3 = 3! = 6[/tex]
The routes are given as follows, with each first letter representing the city:
C - H - P, C - P - H, P - C - H, P - H - C, H - P - C, H - C - P.
More can be learned about the arrangements formula at https://brainly.com/question/24648661
#SPJ1