Explore the concept of deadlocks in programming using the dining philosophers' problem as a key example.