Q4. Assume that a system has four processes and five allocable resources. The current allocation and request matrix are as follows Crrent Allocation Matrix 1021 1 2011 0 Process A Process E Process C Process D Process A Process E Process C Process D Request Matrix 2 020 0 2003 0 1100 0 0010 1 Available: 0 0 x y l What is the smallest value of x and y for which the current state is a safe state? For the smallest value of x and y, show a sequence of scheduling (if exists) that will lead to successful completion of the tasks. No points will be given without proper calculation. (5 points)