A system has four processes and five allocable resources. The current allocation and request matrix are as follows:

The request matrix specifies how many of each type of resources are still needed by each process, in addition to what it currently has.

For what value of x this will be a safe state?

Show a sequence of scheduling (if exists) that will lead to successful completion of the tasks.

Process A Process E Process C Process D Current Allocation Matrix 0 2 0 1 2 011 0 10 01 1 10 1 Process A Process B Process C Process D Request Matrix 2 0 2 00 2 0 0 3 0 110 0 0 0 0 0 0 1 Available resources: 1 11 x 1