Chef Remy wants to buy eggs, onions and cheese. He enters an unusually shaped supermarket whose stalls form mazes. Because the shop is crowded, he uses a map to avoid dead ends and travels along each corridor at most once.
First he visits the egg stall.
1. Which eggs will he not collect? Cross them out.
2. Using the eggs not crossed out, find a route that collects as many eggs as possible.
3. What is the greatest number of eggs he can collect?
4. He next visits the onion stall. Under the same rule, what is the greatest number of onions he can collect?
5. Finally he visits the cheese stall. Under the same rule, what is the greatest number of pieces of cheese he can collect?
