Question 3Six bridges connect the islands shown. An explorer visits A, then B, then C, then D, and returns to A, crossing one connecting bridge on each leg. How many routes are possible? 24567