In a system consisting of four processes and five resource types, the current allocation and maximum needs are as follows Process PO P1 P2 P3 Allocation 10211 20110 11010 Maximum 11213 22210 21310 11221 Available 00x12 What is the smallest value of 'x' that can keep the system in a safe state? Once you find the 'x value, find a safe execution order using the Safety Algorithm we discussed in the lecture. Include a step-by-step walk-through of the Safety Algorithm