Why is insertion and deletion faster in a linked list compared to an array?

Question

Considering that for both linked list and array, inserting/deleting data from middle has O(n) complexity, why is linked list being preferred? Is array\'s O(n) (p