## Task 2 - 270522

A tourist who lives in Magdeburg (M) wants to visit each of the cities Schwerin (S), Neubrandenburg (N), and Berlin (B) exactly once on a round trip and then return to his place of residence.

One possible route would be from Magdeburg via Berlin, Schwerin, and Neubrandenburg back to Magdeburg (see illustration).

List all the travel routes the tourist can choose under the given conditions!

How many travel routes are there in total?

![](https://cdn.mathpix.com/cropped/2024_06_06_b85a894aa8dbf722a7b3g-0117.jpg?height=254&width=254&top_left_y=975&top_left_x=1506)

A justification is not required.
The required specification of travel routes can be made in graphical form or by indicating the respective sequence of cities to be chosen.

An example of a complete specification is, for instance: $M B N S M, M B S N M, M N B S M, M N S B M, M S B N M$, $M S N B M$.

The number of travel routes is 6.