operting systems

5. (%25) a) Analyze the given algorithm proposed to solve the critical section problem(CSP). Identify and correct the shortcomings of this algorithm. b) For two processes, show that the three criteria of the CSP are satisfied in the your corrected algorithm b) Write a non busy waiting lock (Semaphore) implementation in pseudo code for mutual exclusion? (Tr: a) Kritik blge problemini zmek iin yazlms asadaki algortimadaki problem nedir? Dzeltiniz.b)Iki process iin kritik blge probleminin 3 kuulumun dzeltilmi algoritmada salandm gsterin. C) Bu czm yerine, mesggul bekleme icermeyen bir (semafor) implemantasyonu yazmiz.) do \{ while (turn!=j); //critical section starts do critical operations turn=j; //remainder section starts \} while true