Describe how the Swap() instruction can be used to provide mutual exclusion that satisfies the bounded-waiting requirement.

swap.code

do {

    waiting[i] = true;
    key = true;
    while (waiting[i] && key) Swap(&key, &lock);
    
    // critical tasks
    
    j = (i + 1) % n;
    while (i != j && !waiting[j]) j = (i + 1) % n;
    
    if (i == j) lock = false;
    else waiting[j] = false;

} while (true);