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?
Four friends are sitting on a tree. Each one of them is wearing a hat. They don't know which coloured hat are they wearing but they do know that two of them have green hats and two of them have orange hats.
Adam is sitting on the top branch and he can see the hats of Billy and Cyrus. Billy is sitting on a branch above Cyrus and he can see Cyrus hat. Duke is sitting at the base of the tree. Branches are covering him fully and no one can see his hat.
Now they are not allowed to look upwards. Who do you think will shout the colour of his hat first?
There were two grandmothers and their two granddaughters.
There were two husbands and their two wives.
There were two fathers and their two daughters.
There were two mothers and their two sons.
There were two maidens and their two mothers.
There were two sisters and their two brothers.
Yet there are only six, who are buried here,
All are born legitimate and relationships clear.
How can this happen?