Six cities of India – Jammu, Kolkata, Lucknow, Mumbai, Nagpur and Orcha are connected by one way and two way highways as indicated in the diagram given below. The arrow head indicates the direction in which the traffic is allowed to flow. No other route is available except those given in the diagram.
For which of the following cities it is not possible for a person to start his journey from the city and pass through all the other cities and come back to the same city, without passing through any city more than once?
A person can start and return the same city while passing through every city.
So, According to the given data option d is correct
<p>A person can start and return the same city while passing through every city.</p><p><em>So, According to the given data option d is correct</em></p>
From the 1st statement: B2 is now as old as B3 was in the past. Hence B2 is younger to B3 or B2 < B3. Also sometime in the past B1 was twice as old as B4. So B1 is elder to B4 or B1 > B4. B3 will be as old as B5 in future, hence B3 < B5. The second statement suggests: B1 > B6. B1 was as old as B7 in the past. Hence B1 > B7. B4 will be as old as B6 in future. Hence B6 > B4. B6 will be as old as B7 now in future. Hence B7 > B6. B7 was as old as B2, when B1 was as old as B7. Hence B1 = B2. Combining both the results, we get: and B5 > B3 > B2 = B1 > B7 > B6 > B4 (Note by B1 = B2, it is meant that they are of similar age group, not necessarily the same).
This website uses Cookies and related technologies for the site to function correctly and securely, improve & personalise your browsing experience, analyse traffic, and support our marketing efforts and serve the Core Purpose. By continuing to browse the site, you agree to Privacy Policy and Cookie Policy.