Question: A traveling salesperson beginning a trip at city A must visit (in order) cities X, Y, and Z before returning to A. Several roads connect each pair of cities. There are four different ways of traveling between cities A and X, three routes between X and Y, five between Y and Z, and two between Z and A. By how many different routes can the salesperson complete the trip?