Compare the use of the variable turn in Dekkers algorithm with the use of the variable last in Petersons algorithm. What advantage does Dekkers algorithm have? Does it matter if the order of the assignments in the postprotocol is switched?

Table 3.13. Peterson's algorithm false, wantq false boolean wantp integer last 1 loop forever pl: non-critical section p2: wantp+ true p3: last 1 p4: await wantq = false or last = 2 p5: critical section p6: wantp + false loop forever q1: non-critical section 42: want true 93: last 2 q4: await wantp = false or last = 1 25: critical section q6: wantq false 2 p pl: p2: 92: p3: Algorithm 3.10: Dekker's algorithm boolean wantp = false, want + false 5 Home integer turn + 1 SD GBS OM eq loop forever loop forever non-critical section 91: non-critical section wantp + true wantq + true while wanta q3: while wantp drvo owosiz if turn = 2 if turn = 1 ans wantp = false wantq false ODORO await turn = 1 await turn = 2 wantp + true wantq = true critical section q8: critical section turn + 2 turn + 1 wantp = false q10: wantq + false p4: 94: p5: 95: p6: 96: 97: p7: p8: p9: q9: | p10