A mules travels the same distance daily.
I noticed that two of his legs travels 10km and the remaining two travels 12km.
Obviously two mules legs cannot be a 2km ahead of the other 2.
The mules is perfectly normal. So how come this be true ?
The two towns are exactly 100 km apart. John leaves City A driving at 30 km/hr and Jacob leaves City B half an hour later driving at 60 km/hr. Who will be closer to City A when they meet?
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?