Detecting Deadlock: Assume you have created two threads A and B. These threads must share two resources, we control the access to these resources through mutexes Pi and vi where i represents the resource Write a series of programs to demonstrate each of the following possibilities. In a comment field before your code prove deadlock exists or not. Proving deadlock is an example of an existence proof. Proving no deadlock requires an exhaustion proof. I recommend that you use mutexes.cpp as a framework tor sI-s7. Case 1 (s1.cpp) Process A P1 P2 V1 V2 Process B P1 P2 V1 V2 Case 2: (s2.cpp) Process A P1 P2 rocess B P1 P2 V2 V1 Case 3 (s3.cpp) Process A P1 V1 P2 V2 Process B P1 V1 P2 V2 Case 4: (s4.cpp) Process A P1 P2 Process B P2 P1 V1 V2 V2 Case 5: (s5.cpp) Process A P1 V1 P2 V2 rocess B P2 P1 Vi Case 6: s6.cpp) Process A Process B P2 V2 V1 Case 7: (s7.cpp) Process A P2 V2 P1 V1 Process B Pl V1 V2