Answer 1 b onlyLast 4 digit of my student id is 1889 Do not share as this will be treated as plagiarism by Blended Learning CenterAnswer all of the questions.1"If the resource allocation graph contains cycle/cycles, then the system may ora.may not be in a deadlocked state." Is this statement true? Explain your answer with aproper example.b.Suppose a system uses Bankers algorithm to avoid deadlock. Consider there are sixprocesses in the system. They need four types of resources: P, Q, R, and S. They havesome resources and need more resources to complete their task. The system has 4instances of resource P, 2 instances of resource Q, 1 instance of resource R and 4instances of resource S initially available. In the Allocation and Max matrix the value forP, Q. R and S of process Ps will be the last four digits of your own DIU ID.1For example, if a student has ID 171-15-12345, then the value for P=2, Q=3, R=4 andS=5 of process Ps for Allocation and Max Matrix.Now see the following snapshot and give the answer of the following questions.|РrосessAllocationРгосeМaximumesssesRSP.RSPO112РО3322P1132P15413P2231P26344P322P3221Р41111P43223P5P51.Find out the content of the Need of each process.П.Find out the safe sequence for the above scenario.Find out the total number of instances of the resource type P, Q, R and S.II.IV.Suppose two requests from two processes come. One request from process P3for (0, 0, 1 and 1) resources and another request from P4 for (1, 1, 1 and 1)resources. Can these requests be granted immedlately ensuring the system Issafe? If yes, show the safe sequence. If no, explain it.Suppose 1MB memory is partitioned into some fixed sized blocks each block having asize of 128KB. The list of request orders is: 50k, 150k, 90k, 130k, 70k, 80k, 120k, 180k,2a.and 60k. Do you think it is possible for an operating syslem to serve all the requests byimplementing the memory allocation algorithms? Justify your answer.b.What will be the dynamic memory allocation in the worst fit manner using the followinginformation?BlockB101B102B103B104В105Size105K80K208K50K160KProcessesSizeTurnaroundP165K2P2170K3P3200K2P490K2P535KX+1P6100KX+2

As you have posted multipart question, we will solve the first 3 parts for you. 1.b. 1. Need is…

Do not share as this will be treated as plagiarism by Blended Learning Center Answer all of the questions. a. "If the resource allocation graph contains cycle/cycles, then the system may or may not be in a deadlocked state." Is this statement true? Explain your answer with a 1 proper example. b. Suppose a system uses Bankers algorithm to avoid deadlock. Consider there are six processes in the system. They need four types of resources: P, Q, R, and S. They have some resources and need more resources to complete their task. The system has 4 instances of resource P, 2 instances of resource Q, 1 instance of resource R and 4 instances of resource S initially available. In the Allocation and Max matrix the value for P, Q. R and S of process Ps will be the last four digits of your own DIU ID. 1 For example, if a student has ID 171-15-12345, then the value for P=2, Q=3, R=4 and S=5 of process P, for Allocation and Max Matrix. Now see the following snapshot and give the answer of the following questions. Process Allocation Proce Маximum es Sses R Q R. 2 2 2 PO 1 PO 3 3 P1 1 3 P1 5 3. P2 2 2 1 3 P2 6 P3 P3 2 2 P4 1 1 1 P4 3 2 2 3 P5 P5 Find out the content of the Need of each process. Find out the safe sequence for the above scenario. Find out the total number of instances of the resource type P, Q, Rand S. 1. I. II. IV. Suppose two requests from two processes come. One request from process P3 for (0, 0, 1 and 1) resources and another request from P4 for (1, 1, 1 and 1) resources. Can these requests be granted immediately ensuring the system is safe? If yes, show the safe sequence. If no, explain it. 2 Suppose IMB memory is partitioned into some fixed sized blocks each block having a a. size of 128KB. The list of request orders is: 50k, 150k, 90k, 130k, 70k, 80k, 120k, 180k, and 60k. Do you think it is possible for an operating system to serve all the requests by implementing the memory allocation algorithms? Justify your answer. b. What will be the dynamic memory allocation in the worst fit manner using the following information? Block BI01 B102 B103 B104 B105 Size 105K 80K 208K 50K 160K Processes Size Turnaround P1 65K 2 P2 170K 3 P3 200K 2 P4 90K 2 P5 35K X+1 ...