QUESTION 8 a) What is the difference between deadlock and starvation? (2 marks) b) Briefly describe TWO (2) ways of handling deadlock prevention. (2 marks) R3 c) Given the information needed in Banker's algorithm as follows. Maximum claim Allocated Resources Proces RO R1 R2 R3 Proces R. R1 R2 S S Po 0 1 Po 0 1 P1 1 7 5 P 1 0 P2 2 3 5 P2 1 3 5 P3 0 6 5 P3 0 6 3 P4 0 6 5 6 P4 0 0 1 NOON Wolo 2 0 4 2 4 Given the available resources, Avail = , explain the status of P1, P2, P3 and P4 whether each process can have its maximum claim (safe or unsafe). (4 marks) d) Given a general allocation graph. Show whether the graph is reducible or not. R. P. RO (4 marks)