Five friends Alex,Bill,Cole ,dan & ed visit a few places taking different routes.All cities are visted by diff number of people.The 5 cities F,G,H,I & J are sequentically statoned.Dan takes the direct route to I and visits two places,F is visted by least no. of people.Bill visits G,but not I,& I visted by odd number of people,If dan visits J,Ed also vists J.Cole dosn't vist H.Alex vists all the places.Ed visits lesser cities then cole.what is the ROUTE followed by ED?
a)G,H,J
b.G,I,J
c.G,J
d.none

• option B
  since I is visited by odd no of people and bill does not visit I, it leaves either there was 1 or 3 visitor to I as Dan visited I and Alex visited all cities two of them visited and it should be odd so Ed also visited I there is I only in option B
• 7 years agoHelpfull: Yes(4) No(1)
• c: G, J
  I visited by odd people then c can't visit I as if we assume D visit I then number becomes 4 for city I.
• 8 years agoHelpfull: Yes(3) No(1)
• option b
  G,I,J
  
• 8 years agoHelpfull: Yes(2) No(0)
• b.G I J
  C visits less no. of cities than E and I is visited by odd no. of people excluding B (given) and c (BCZ C
• 8 years agoHelpfull: Yes(1) No(2)
• ans C
  I visited by the odd no.of people so Dan only visited I. so, Option B is nt valid for Ed. then, Ed visits lesser cities than Cole but Cole doesn't visit H so, Ed also wont visit option A also false. so ans is C.
• 8 years agoHelpfull: Yes(1) No(1)
• J is visited by 5 people, I by 3, H by 1, G by and f by 1(read 1st line all cities are visited by different no. people). Take these value and apply the logic
• 7 years agoHelpfull: Yes(1) No(0)
• hii, anyone explain this probleam
• 8 years agoHelpfull: Yes(0) No(1)
• C:G,C
  I visited by odd number of peoples and f visited by least no. of people so cole can't visit fand it will not visit h so he will visit only 3 places and ed has to vivit less places than cole.
• 8 years agoHelpfull: Yes(0) No(2)
• ni aata yaar .....................................................................................................
• 3 years agoHelpfull: Yes(0) No(0)