1. Implement a perfect failure detector P using an eventually perfect failure detector P.

2. Consider the following two-process mutual exclusion algorithm:

program resolve{for process i {1, 2}}

define x: integer, y: boolean

initially y = false

do true

start: x := i;

if y

do y skip od;

goto start;

fi;

y := true

if x i

y := false;

do x 0 skip od;

goto start;

fi;

critical section;

y := false; x := 0

non-critical section;

od

a. Does it satisfy the requirements of a correct solution?

b. If n processes 1, 2,.., n execute the previous algorithm, then what is the maximum number of processes that can be in their CSs concurrently?