Boolean lock; Boolean waiting[n]; while (true) { Boolean lock; while ( TestAndSet (&lock)) do { ; /* do nothing waiting[i] = TRUE; key = TRUE; // critical section while (waiting [i] &&key) key = TestAndSet (&lock); lock = FALSE waiting[i] = FALSE; // remainder section //critical section } j = (I + 1) %n; while ((j != 1) && !waiting[j]) j = (j + 1) %n; If (j == i) lock = FALSE; else waiting[j] = FALSE; // remainder section } while (TRUE); Shown above are two ways for the TestAndSet hardware instruction that can be used to insure mutual exclusion. i. What advantage does the solution on the right have over the solution on the left? ii. Show that the solution on the right meets the mutual exclusion requirement for the solution to the critical section problem. iii. Show that the solution on the right meets the bounded waiting requirement for the critical section problem. Include in your answer what the upper bound on the waiting time for a process that wants t