different processes and N+1 storage devices (reso manages N Because of the different needs of the processes, defices are num of various typee im to N, and e A rious types process, i (where 0-N-1), is required to use both device ) devicetcass in place of any oher device. Thus, to any o is available, and so greater overlap can ba achieved. The folloing Hour use ization a 10 tntor processi, have been proposed for this station. Assume An operating system bered 0 use both defice) and N is universal and can be each process has an addiional deice cntonization aigonthms for od there are no errors code in the code, Evaluate each algorithm and specify the most ap of the following statements, An answer may be given more than once. Aliso state the forchoosing each answer. i] Feasible reason toa ble, but less than maximum overlap among these solutions. Feasible, with maximum overnap among these solutions 12 oes not synchronize properly. i.e., Potential loss of integrity. 4 May lead to indefinite wait by a process. May lead to deadlock among two or more processes. ables and semaphores: The Algorithms use the following var NameInitial value Flag Device[i] 1,for 0 Mutex Use Indicates vhich process has dece N binary semaphore array for N 1 deices binary semaphore to protect Flag.