Why is a list access O(1) in Python?

Question

I understand that a list is different from an array. But still, O(1)? That would mean accessing an element in a list would be as fast as accessing an element in a dict, which we

Answer 1

The minimum possible I can see is O(log n) from a strict computer science standpoint