The figure shows a diagram of the roads connecting the cities A, B, C, D, E, F, W, H, I, K, L. You can move along each road only in one direction, indicated by the arrow. How many exist different paths from city A to city L passing through city D?
(Image can be enlarged by clicking on it. Will open in a new window)