You have 10 balls with you. A friend of yours out of nowhere asks you to place those ten balls in five lines such that each of the lines has exactly 4 balls on them. He needs to check your intelligence. Prove him by doing the task.

A finger goes in me. You fiddle with me when you're bored. The best man always has me first. What am I?

I am the first thing you need while camping.
I am always with the person named Marcos Valencia and Carrick.
But Pogba Zlatan and Rooney think I am wasteful and do not need me.
I am the second to the last thing to add when you are making a patch.

What am I?

10+10 and 11+11 can give you the same answer.

Explain how?

A person was killed at a house party. When the police arrive, there are six people present in the house who are the friends of the victim. The name of the friends is Rohit, Aman, Nick, Gagan, and Randy.

Near the dead body, they find a few numbers written with blood by the victim on the floor. The numbers are 8, 5, 4, and 11.

The police arrests one of the friends for the murder. Whom did they arrest and why?

You board a train. The train will have to enter a tunnel soon. You are claustrophobic. Which place is the best for you to sit?

A train full of passengers goes through a tunnel. When the train comes out from the other end, there is no single person on the train.

How did it happen?

A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

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?

Decode below three cipher riddles:

26 L of the A
7 D of the W
1000 Y in a M