Show that any of the following modifications to Petersons algorithm (given below) makes it incorrect, with respect to mutual exclusion, progress, and no starvation properties:

1. A process in Petersons algorithm sets the turn variable to itself instead of setting it to the other process.

2. A process sets the turn variable before setting the wantCS variable.

You can show that for two processes.

You can use contradition.

Shared bool wantCS[0] = false, bool wantCS[1] = false, int turn = 0; Process o Request CS(O) { wants[0] = true; turn = 1; while (wantCS[U] == true && turn == 1) 0: 3 Process Request CS(1) { wants[] = true: turn = 0; while (wantCS[0] == true && turn == 0); ) ReleaseCS(O) { wantCS[0] = false; ) ReleaseCS(1) { want S[] = false; }