The city of Robville contains eight landmarks denoted as vertices `N` to `U` on the network diagram below. The edges on this network represent the roads that link the eight landmarks.
- Write down the degree of vertex `U`. (1 mark)
- Steven wants to visit each landmark, but drive along each road only once. He will begin his journey at landmark `N`.
- At which landmark must he finish his journey? (1 mark)
- Regardless of which route Steven decides to take, how many of the landmarks (including those at the start and finish) will he see on exactly two occasions? (1 mark)
- Cathy decides to visit each landmark only once.
- Suppose she starts at `S`, then visits `R` and finishes at `T`.
Write down the order Cathy will visit the landmarks. (1 mark)
- Suppose Cathy starts at `S`, then visits `R` but does not finish at `T`.
List three different ways that she can visit the landmarks. (1 mark)
- Suppose she starts at `S`, then visits `R` and finishes at `T`.