Explain why this cannot happen in the LockFreeList algorithm. A node with item x is logically but not yet physically removed by some thread, then the same item x is added into the list by another thread, and finally a contains () call by a third thread traverses the list, finding the logically removed node, and returning false, even though the linearization order of the remove () and add () implies that x is in the set.