A salesperson living in city A wishes to visit five cities B, C, D, E, and F. Suppose all cities are connected, except that B and C are not directly connected. How many different travel plans could be constructed to visit each city exactly once and then return home?
