Figures (i) and (ii) represent intercity highway systems. The black dots represent
cities and the line segments between them represent intercity highways.
A salesperson needs to make a trip. She needs to start from a city, visit each of the
remaining cities exactly once, and finally return to the same city from which she
started.
Which one of the following options is then true?

Step 1: The salesperson's trip -- start at a city, visit every other city exactly once, and return to the start -- is exactly a Hamiltonian circuit on the highway graph.
Step 2: A necessary condition for a graph to contain a Hamiltonian circuit is that every vertex must have degree at least 2, because the circuit must enter and leave each city using two distinct edges.
Step 3: In figure (i), every city (vertex) has at least two highways (edges) connecting it to other cities, and the network is arranged so that a closed tour visiting every city exactly once can be traced -- so a Hamiltonian circuit exists for (i).
Step 4: In figure (ii), at least one city is connected to the rest of the network by only a single highway (a degree-1 vertex), so that city can be entered but not exited without reusing that same highway. Hence no Hamiltonian circuit exists for (ii).
Therefore the round trip is possible for (i) but not for (ii).
Final Answer: \(\boxed{A}\)
The figure shows two 4-tile patterns.
Either one or both of the patterns can be used any number of times and in any
orientation to construct a new pattern. Which one of the options below cannot be
constructed by using only these two 4-tile patterns assuming there are no overlaps
among them?

A black square PQRS has been cut into two parts. One part of it is shown in
Panel I. Which one of the shapes in Panel II is the other part?

Water : P :: Food : Q
Choose the P and Q combination from the options below to form a meaningful
analogy.
Two tiles are missing in Panel I. Which one of the options in Panel II is the
appropriate choice for the missing tiles?
