For the Lock Free Hash Set, design a lock-free data structure to re-place the fixed-size bucket array. Your data structure should allow for un bounded doubling of the number of buckets in order to...

For the Lock Free Hash Set, design a lock-free data structure to re-place the fixed-size bucket array. Your data structure should allow for un bounded doubling of the number of buckets in order to keep the average bucket length be-low THRES HOLD. Describe how you would implement the methods in and how your implementation preserves lock-freedom, correctness, and expected or amortized O(1)work.