6. Give the precedence graph for the following code and check whether a deadlock may occur or not. If there is a deadlock, then modify the codes to fix that: Begin Semaphore S1,S2; Si=0;32=0; ParBegin P1; P2; ParEnd End Program P: Begin Acquire(s); codei; Release(s2); End Program P2: Begin Acquire(s2); code2; Release(s1); End 6. Give the precedence graph for the following code and check whether a deadlock may occur or not. If there is a deadlock, then modify the codes to fix that: Begin Semaphore S1,S2; Si=0;32=0; ParBegin P1; P2; ParEnd End Program P: Begin Acquire(s); codei; Release(s2); End Program P2: Begin Acquire(s2); code2; Release(s1); End