How does a hash table work internally?

I use dictionaries/maps all the time, but I want to understand how they work:

1. How is the hash function used?
2. What happens with hash collisions?
3. Why is lookup O(1)?
4. When does it become O(n)?

Can someone explain the internals?