Cut the Bridges and ConquerComputer Science Level 5
As a Sheldor the conqueror, you're supposed to conquer the kingdom of Wonder-blunder-berg, which happens to be a collection of cities connected with roads.
This time you plan to destroy the bridges, which are roads when rendered unusable, splits the kingdom into parts that cannot communicate with each other.
In the above kingdom, the red roads are bridges.
How many such bridges exist in the kingdom?
Clarification: A component is a maximal set of cities such that there is a walk between any two cities of the set. A bridge is a road which when removed increases the number of components.
Try also: Can you attack cities and conquer?