For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion?

For how many processes which are sharing common data, the Dekker's algorithm implements mutual exclusion? Correct Answer 2

Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in an unpublished paper on sequential process descriptions and his manuscript on cooperating sequential processes.

Related Questions

EXEMPTION : EXCLUSION
In the passage exclusion means
If the name of a tribe has to be excluded from the list of Scheduled Tribe, who has the power for such exclusion?
What scheduling algorithm allows processes that are logical runnable to be temporarily suspended?