A stack ADT implemented with a fixed-size array can overflow when pushed too many times; the same ADT over a linked list cannot. Does that mean the array implementation is wrong?

D. No - it means the ADT's specification did not say.

Correctness is relative to a specification, so the question cannot be answered until one is stated. Which is why capacity limits and error behaviour belong in the interface, 'push raises StackFull at capacity' is a promise callers can program against. The linked version pays for its unboundedness in pointers and cache behaviour, and a growable array is the usual compromise.