Exercise $2\mathrm{.}3.$ Programmers at the Flaky Computer Corporation designed the protocol shown in Fig. $2\mathrm{.}16$ to achieve $n-$thread mutual exclusion. For each question, either sketch a proof, or display an execution where it fails.

Does this protocol satisfy mutual exclusion?

Is this protocol starvation$-$free?

Is this protocol deadlock$-$free?

Is this protocol livelock$-$free?