Deadlock Detection

Write a program to carry out the simulation of multiple processes executing the sequences of resource requests and execution specified by the input data, checking after each resource allocation request for the existence of deadlock by attempting to find a cycle in the resource graph. If no deadlocks occur during execution, indicate the time when each process executes its last action and the total execution time required for each process. If a deadlock does occur, indicate that fact, the time when the deadlock was detected, and the identification of the processes and resources involved in the circular wait. The samples shown below illustrate the desired output format.