Explain why the fine-grained locking algorithm is not subject to deadlock.

Explain why the fine-grained lists add () method is linearizable.

Explain why the optimistic and lazy locking algorithms are not subject to deadlock.

Show a scenario in the optimistic algorithm where a thread is forever attempting to delete a node.

Hint: since we assume that all the individual node locks are starvation-free, the livelock is not on any individual lock, and a bad execution must repeatedly add and remove nodes from the list.