Question 3An explorer finds four islands connected by six bridges. He wants to visit A, B, C and D in that order, then return to A. How many different routes can he take? 24567