Define an n-bounded compare And Set()object as follows: It provides a compare And Set()method that takes two values, an expected value e and an update value u. For the first n times compare And...

Define an n-bounded compare And Set()object as follows: It provides a compare And Set()method that takes two values, an expected value e and an update value u. For the first n times compare And Set()is called, it behaves like a conventional compare And Set()register: If the object value is equal toe, it is atomically replace d with u, and the method call returns true. If the object value v is not equal toe, the nit is left unchanged, and the method call returns false, along with the valuev. After compare And Set()has been called n times, however, the object enters a faulty state, and all subsequent method calls return ⊥. Show that an n bounded compare And Set()object for n ≥ 2 has consensus number exactlyn.