1. Recall the 5 bridge problem you studied in this lesson. As you saw, any path which uses each
bridge once and only once had to start at the points B or D since there were three lines connected
to them.
B
D
A. List all possible paths which use each bridge once and only once.
B. Can you add one bridge so that there is no possible path which uses each bridge only
once? If so, give one example.
C. Can you add one bridge so that it is still possible to find a path which uses each bridge
only once? If so, give one example.