Which wheel of car does not rotate when you turn your car right?

Can you find out which options fits best with the missing column?

I am a five-letter word and people eat me. If you remove the first letter I become an energy form. If you remove the first two letters, I am needed to live. Scramble the last three letters and I am a drink. What word am I?

I have nine bottles of wine and one of the nine bottles is poisoned.
I need to find the poisoned bottle with two facts
(1) Poison is deadly, only a sip will cost death
(2) I have two mice to do so.

How should I do it?

I’m orange, I wear a green hat and I sound like a parrot. What am I?

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?

Two in a corner, one in a room, zero in a house, but one in a shelter. What am I?

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?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

It's a 7-letter word.
If we remove 1 letter from it, it remains the same.
If we remove 2 letters from it, it remains the same.
If we remove 3 letters from it, it remains the same.
If we remove all the letters from it, still it remains the same.
What is it?