The minimum value of x and the minimum value of y together for which execution of P can result in a deadlock are.
A multithreaded program P executes with xx number of threads and uses yy number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock ll, then it cannot re-acquire lock ll without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of xx and the minimum value of yy together for which execution of P can result in a deadlock are:
(A) xx = 1, yy = 2
(B) xx = 2, yy = 1
(C) xx = 2, yy = 2
(D) xx = 1, yy = 1