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)
--- 1 WORK AREA LINES (style=lined) ---
- 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)
--- 2 WORK AREA LINES (style=lined) ---
- 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? (2 marks)
--- 4 WORK AREA LINES (style=lined) ---