Shows a FIFO queue implemented with read(),write(),get And Set()(that is, swap), and get And Increment()methods. You may assume this queue is linear izable, and wait-free as long as deq()is never...

Shows a FIFO queue implemented with read(),write(),get And Set()(that is, swap), and get And Increment()methods. You may assume this queue is linear izable, and wait-free as long as deq()is never applied to an empty queue. Consider the following sequence of statements:

• Both get And Set() and get And Increment()methods have consensus number 2.

• We can add a peek()simply by taking a snapshot of the queue (using the method s studied earlier) and returning the item at the head of the queue.

• Using the protocol devised for Exercise 5.8, we can use the resulting queue to solve n-consensus for any n. We have just constructed

a n n-thread consensus protocol using only objects with consensus number Identify the faulty step in this chain of reasoning, and explain what went wrong.