Replacing all read locks with write locks simplifies programming of a fine-grain lock approach, but at the same times reduces concurrency. Estimate the degree of the loss of concurrency on a linked list data structure, assuming that each node has a random but equal probability of being deleted or linked to a new node inserted as its successor. Assume that insertions and deletions balance out each other, keeping the number of nodes in the linked list relatively constant at n nodes.