What is the longest possible distance to reach D, starting from A? Assume that no city can be visited twice.
70 Km
A – B – C – F – I – H – G – D or
A – B – C – F – I – H – E – D
Choice (2)
Share this page with your friends!
Your email address will not be published. Required fields are marked *
Please Create a Free Account to continue! If you already have an account then please Login
Submit Comment/FeedBack