The Skip Queue class is quiescently consistent but not linear iz able. Here is one way to make this class linear iz able by adding a simple times tamping mechanism. After a node is completely inserted...

The Skip Queue class is quiescently consistent but not linear iz able. Here is one way to make this class linear iz able by adding a simple times tamping mechanism. After a node is completely inserted into the Skip Queue, it acquires a time stamp. A thread performing are move Min()notes the time at which it starts its traversal of the lower level of the Skip Queue, and only considers nodes whose time-stamp is earlier than the time at which it started its traversal, effectively ignoring nodes inserted during its traversal. Implement this class and justify why it works.