Consider the 3 processes, P1, P2 and P3 shown in the table. Process Arrival time Time Units Required P1 0 5 P2 1 7 P3 3 4 The completion order of the 3 processes under the policies FCFS and RR2 (round...

Consider the 3 processes, P1, P2 and P3 shown in the table. Process Arrival time Time Units Required P1 0 5 P2 1 7 P3 3 4 The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units)
Q.32 Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location X, increments it by the value i, and returns the old value of X. It is used in the pseudocode shown below to implement a busy-wait lock. L is an unsigned integer shared variable initialized to 0. The value of 0 corresponds to lock being available, while any non-zero value corresponds to the lock being not available.

AcquireLock(L){ while (Fetch_And_Add(L,1)) L = 1;}ReleaseLock(L){ L = 0;} what is This implementation done?