5. (10 pt) Show that the safety algorithm in the banker algorithm requires an order of m n operations. (n is the number of processes and m is the number of recourse types) 6. (50 pt) Consider the following snapshot of a system. There are 5 processes and 3 resources types A with 10, B with 5, and C with 7 instances. Available Allocation A B C A B C Max A B C 3 32 Po 0 1 0 753 P1 200 3 22 P2 302 902 P3 2 1 1 222 P4 002 4 3 3 Answer the following questions using the banker's algorithm a) What is the content of the matrix Need? b) Is the system in a safe state? c) If a request from thread P arrives for (1, 0, 2), can the request be granted immediately? d) What if P4 requests (3, 3, 0) after Pi (item c)? e) What if Po requests (0, 2, 0) after Pi (item c)?