In Section 3.1 the paper discusses an example of a transactional Set object obtained by boosting a highly concurrent skip list. In our lecture we discussed a different highly-concurrent Set implementation (Section 9.8) called LockFreeList. Could LockFreeList be sustituted for skip list in the example shown in Figure 2 of the Boosting paper? What needs to be changed? What impact on performance would such substitution have?