Question7 5 pts Does the bounded-waiting mutual exclusion algorithm with test and set (shown below) give access to waiting processes in FIFO order? C1 (variable is the index of the current process, array waiting is initialized with false values, and variable key is also initialized with false) do i aiting(4)-true key- true hile (waitingi) & key) key- test and set(&key); aiting(] -false /* critical section */ " now the exit section . j*(j+1) % n; key- false else waitingl1]- false; /* renainder section while (true); O cannot say O yes. Always. 5:17 PM 8/3/2018 it depends on the process arrival order and is quite unlikely