What is the next shape from answers A, B, C, and D figure?

Can you count the number of quadrilaterals in the picture below?

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?

There was an aeroplane crash, every single person died, but two people survived. How is this possible?

John killed hundreds of people mercilessly and yet the police were not able to put her behind the bars. Why?

Accidentally, two trains are running in the opposite direction and enter a tunnel that is 200 miles long. A supersonic bird that has fled the lab and taken shelter in the tunnel starts flying from one train towards the other at a speed of 1000 mph. As soon as it reaches the second train, he starts flying back to avoid collision and meets the first train again at the other end. The bird keeps flying to and fro till the trains collide with each other.

What is the total distance that the supersonic bird has traveled till the trains collided?

Can you count the number of triangles in the picture below?

A man was gazing through the window of the 23rd floor of the building. He suddenly opened the window and jumped on the other side of the window. On landing on the floor, there was not a sheer mark of injury on him.

How can that be possible if he did not use any kind of parachute and did not land on a soft surface?

There was a kingdom in which the king had no heir to take over his thrown. Even the queen was dead and he himself was on the verge of dying. He thought about it and then summoned all of the teenagers. He gave one seed each to all of them and asked them to grow the plant. He announced that the one with the most beautiful plant will become the king/queen of the empire after the death of the king.

After a month, all of them were called. The king looked at all of the plants but announced the girl with an empty pot as the queen of the empire. Why?

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?