Consider a road map of a city having 5 approach roads from other places, 10 junctions and no internal road has a dead-end. Every junction except one is associated with 4 roads. If n number of roads are associated with the remaining junction then which of the following values is impossible for n?
1
3
2
5
3
6
4
7