Consider the following modification to Dekker$$s algorithm. It is for n processes and changes what occurs when a process leaves the critical section from

turn $=1-$ i $/*$ P$0$ sets turn to $1$ and P$1$ sets it to $0*/$

to

turn $=($turn $+1)\%$ n $/*$ n is the number of processes$*/$

Does the change enforce mutual exclusion? Does the change prevent deadlock? Does the change prevent starvation? If any of these conditions $($mutual exclusion, deadlock, starvation$)$ are not ensured, explain why.

Attached in picture is the Dekker$$s Algorithm.