in this example, When Both are interested, then DEADLOCK happens
Deadlock ===> Mutual Exclusion ( Restriction is that entry section of each process should be same )
What about PROGRESS ? ( Below image is from 192 page of GALVIN book )
If dead lock happens, then process selection postponed to indefinitely ===> PROGRESS doesn't satisfied.
What about Bounded Waiting ? ( Below image is from 192 page of GALVIN book )
That means if Pi request for CS then Before Pi request grant, there should be a bound on how many times Pj can enter into CS
if DEADLOCK happens, no processes enter into CS, ( even Pj also can not enter) then how we talk about Bounded waiting ?
DEADLOCK ===> we can't judge about Bounded waiting.
For checking Bounded waiting take the possibilities which doesn't lead to DEADLOCK.
in this example, Bounded Waiting is satisfied.