PART III: Deadlock 1. Suppose four processes are running. They are called P1 to P4. There are also four resources available (only one copy of each). They are named RO to R3. At some point each process allocates a different resource for use and holds it forever. Later each of the processes request another one of the four resources. Draw in the space below the resource allocation graph for a circular wait of the 4 processes (deadlock situation). Make sure you draw the graph before moving to the next steps