Why insertion$/$deletion are faster in a linked list?

Group of answer choices

Linked List is not faster as we need to manipulate the addresses of nodes and it will not take a considerable amount of time.

We cannot delete node in Linked List we can only use free$($memory$)$ to adjust node pointers.

None of the options

Linked List is faster because we just need to manipulate the addresses of nodes, so no bit shifting is required in memory, and it will not take that much of time.