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?

Given that

(78)^9 = 6
And (69)^4 = 11

Can you find out

(99)^2 =?

(Note: This is Logical, not Mathematical)

Jack and Joseph are well-known golf rivals. One Day during a match, they were level at a score of 30. Jack hit a bad shot and Joseph added 10 to his score. Joseph then hit an awesome shot and he won the game.

How ?

What can run but never walks, has a mouth but never talks, has a head but never weeps, has a bed but never sleeps?

A Shopkeeper sold a few chickens to four different customers on a particular day. It was such that each customer purchased half of the remaining chickens and half the chicken more.

Can you find out how many chicken were sold by the shopkeeper on that day if we tell you that the fourth customer bought a single chicken ?

The current time can be represented by below textual rebus.

0
=========
B.Sc
LLB

Can you tell us the current time?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?

I am a seven-letter word but if you remove four of my letters I will have one left. What word am I?

Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?