The image below shows how packets might be routed across the Internet between major connection points in the United States. For example, a packet sent from location #1 (Oregon) to location #5 (Texas) has multiple routes, including {3 - 4}, {2 - 4}, {3 - 7 - 6}, and others. Now, imagine there are failures at locations #3 and #6. The only route remaining between #1 and #5 is {2 - 4}.
Packet routing diagram
Each answer on the left describes a starting and ending location (like "ROUTE #1 to #5"), plus a list of locations that have currently failed (like "FAILED: #3, #6"). The answers on the right list possible routes between locations, not including the starting and ending numbers. Drag the valid route from the right underneath the starting and ending location that the route will satisfy, avoiding the listed failure points. Not all routes will be used!
Fill in the missing pieces:
ROUTE #1 to #7, FAILED: #3, #8
ROUTE #9 to #5, FAILED: #8
ROUTE #7 to #11, FAILED: #6, #10
ROUTE #7 to #2, FAILED: #3, #6
ROUTE #1 to #11, FAILED: #3, #5
Choose from the following choices:
A. 7 - 6
B. 10 - 5 - 4
C. 3 - 4 - 5 - 6
D. 2 - 3
E. 2 - 4 - 6
F. 3 - 7 - 6
G. 9 - 8 - 10 - 5 - 4
H. No possible route
I. 2 - 4 - 6 - 8 - 10
ROUTE #1 to #7, FAILED: #3, #8: F. 3-7-6
ROUTE #9 to #5, FAILED: #8: G. 9-8-10-5-4
ROUTE #7 to #11, FAILED: #6, #10: H. No possible route
ROUTE #7 to #2, FAILED: #3, #6: D. 2-3
ROUTE #1 to #11, FAILED: #3, #5: H. No possible route