CS332 HW 06 NAME: DEADLOCK AVOIDANCE sequence process P1 P2 P3 P4 P5 max claim 1 2 2 7 7 3 08 3 4 7 5 3 6 7 3 0 0 4 4 allocation 1 1 2 4 3 1 0 4 1 3 4 2 3 2 4 1 0 0 2 3 needs 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 2 3 available 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6 pts Fill in the needs column Fill in the changes to the avail column as the algorithm progresses Show the sequence if any: sequence: Is the system in a safe state? What is the total number of resources for the first resource shown? 3 pts 3 pts 3 pts 15 points total