Write a program to implement the deadlock detection algorithm with multiple resources

of each type. Your program should read from a file the following inputs: the

number of processes, the number of resource types, the number of resources of each

type in existence (vector E ), the current allocation matrix C (first row, followed by the

second row, and so on), the request matrix R (first row, followed by the second row,

and so on). The output of your program should indicate whether there is a deadlock in

the system. In case there is, the program should print out the identities of all processes

that are deadlocked. (In Java)