There are people and strange monkeys on this island, and you can not tell who is who (Edit: until you understand what they said - see below). They speak either only the truth or only lies.
Who are the following two guys?
A: B is a lying monkey. I am human.
B: A is telling the truth.

Which of the following words don't belong in the group and why?
CORSET, COSTER, SECTOR, ESCORT, COURTS

Remove two matchsticks to make the below equation correct.

There is a family that live in a round house. The two parents go out for a movie and leave a babysitter to watch their son. They come back and the kid was not there. Some one kidnapped him. The maid said she was cleaning in a corner. The cook said he was making pizza. The babysitter said she was getting a board game. Who kidnapped him.

Count the number of times the letter "F" appears in the following paragraph:

FAY FRIED FIFTY POUNDS OF
SALTED FISH AND THREE POUNDS
OF DRY FENNEL FOR DINNER FOR
FORTY MEMBERS OF HER FATHER'S FAMILY.

It has five wheels, though often think four, You cannot use it without that one more, You can put things in it, you can strap things on top, You can't find it in the market, but you can still go shop. What is it?

There are three boxes of different sizes with three cupcakes inside each of the boxes in Christina's kitchen. At night her daughter wakes up and goes to the kitchen. She opens a box and eats all three cakes.

But in the morning Christina finds out that each box still had three cupcakes. How?

In a classic wine shop, the list of three most popular wines are:
- The cost of 1 French wine bottle: 500$
- The cost of 1 German wine bottle: 100$
- The cost of 20 Dutch wine bottles: 100$

John entered the wine shop and he needs to buy
- All three types of wine bottles.
- Needs to buy Dutch wine bottles in multiples of 20.
- Need to buy 100 wine bottles in total.

John has only 10000$. How many wine bottles of each type, John must buy?

Replace the question mark with the number below given a simple math problem.

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?