1. (b ightarrow a ightarrow c ightarrow d ightarrow b) 2. (b ightarrow a ightarrow d ightarrow c

1. \(b \rightarrow a \rightarrow c \rightarrow d \rightarrow b\)
2. \(b \rightarrow a \rightarrow d \rightarrow c \rightarrow b\)
3. \(b \rightarrow c \rightarrow a \rightarrow d \rightarrow b\)
4. \(b \rightarrow c \rightarrow d \rightarrow a \rightarrow b\)
5. \(b \rightarrow d \rightarrow a \rightarrow c \rightarrow b\)
6. \(b \rightarrow d \rightarrow c \rightarrow a \rightarrow b\)

All the distinct Hamilton cycles for a complete graph are given. Indicate which pairs of Hamilton cycles (directed cycles) lie on the same cycle (undirected cycle) in the graph.