Consider the following two-thread Quasi Consensus problem. Two threads, A and B, are each given a binary input. If both have input v, then both must decide v. If they have mixed inputs, then either...

Consider the following two-thread Quasi Consensus problem. Two threads, A and B, are each given a binary input. If both have input v, then both must decide v. If they have mixed inputs, then either they must agree, or B may decide 0 and A may decide 1 (but not vice versa).Here are three possible exercises (only one of which works):

1.Give a two-thread consensus protocol using Quasi Consensus showing it has consensus number (at least) 2.

2. Give a critical-state proof that this object’s consensus number is 1.

3. Give a read–write implementation of Quasi Consensus, thereby showing it has consensus number 1.