Consider program for P1 and P2:
Here, m and n are binary semaphore variables whose values are initially initialized to 1. x and y are shared resources whose values are initialized to 0.
Which of the following holds by above processes?
A :- Deadlock and no mutual exclusion
B :-Deadlock and race condition
C :-No deadlocks and no race condition
D:- Race condition and no deadlock