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?

There's one "sport" in which neither the spectators nor the participants know the score or the leader until the contest ends.

What is it?

I am sure no one can have two things for dinner. what are they?

What does this rebus picture identify?

One fine day, an intellectual man came to the emperor's court with the aim of testing Birbal's wittiness. In order to do this, he challenged Birbal to answer his question and hence prove that he was as intelligent and witty as he was said to be.
He asked Birbal, Do you want me to ask one difficult question or a hundred easy ones?
Since both Akbar and Birbal had had a tough day and were eager to leave, Birbal hastily told the intellectual to ask him a single difficult question.
Intellectual: OK. Tell me what came first into the world, the egg or the chicken?
Of course, the chicken, Birbal replied with a smile.
This time with a note of victory in his voice, the intellectual asked Birbal, How will you demonstrate that?
What did Birbal say?

It is Secret Agent Bond Girl Friend's birthday but he is on a secret mission

Mr Bond has a secret device by which he can only use the below words for sending the message.

Dumbo, Nazi, Carrot, Ronda, Zambia, Racing, TinTin, Seou, Zareeba, Laltain, Saphire, Tar, Orphan, Audition, Biscotti.

Mr Bond sends the following message to her girlfriend:
Carrot Dumbo Nazi Racing Ronda Zambia TinTin Seou Laltain Zareeba Tar Biscotti Orphan Audition Snake

What does Mr. Bond's Message say?

The following alphametic has only one solution. Can you find it?
ENLIST + SILENT + LISTEN = ANAGRAM

PS: You may start the number from 0.

Can you name some countries which do not have the alphabet 'A' in them?

Using mathematical symbols like +, -, and x in order to make the equations correct. Replace # with the above-given symbols.

9 # 8 # 7 # 6 # 5 # 4 = 91

What will be the best approach to finding all the prime numbers less than 75 that leave an odd reminder when we divide them with 5?