What is the time complexity improvement of skip lists from linked lists in insertion and deletion?

What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
a) O(n) to O(logn) where n is number of elements
b) O(n) to O(1) where n is number of elements
c) no change
d) O(n) to O(n²) where n is number of elements