please i need the answer 6.5. Given the following state of a system:The system comprises of five processes and four resources.P1-P5 denotes the set of processes.R1-R4 denotes the set of resources.Total Existing Resources:R1R2R3R436346.13/ KEY TERMS, REVIEW QUESTIONS, AND PROBLEMS 333Snapshot at the initial time stage:AllocationClaimR1R2 R3 R4 R1R2R3 R4P1 30116 2 11P2 01000 212P3 1 110 3210P4 11011111P5 00002 111a. Compute the Available vector.b. Compute the Need Matrix.c. Is the current allocation state safe? If so, give a safe sequence of the process.In addition, show how the Available (working array) changes as each process.terminates.d. If the request (1, 1, 0, 0) from P1 arrives, will it be correct to grant the request?Justify your decision. 11.3. Consider a disk drive with 4,000 cylinders, numbered from 0 to 3,999. The requestqueue has the following composition:1045 750 932 878 1365 1787 1245 664 1678 1897If the current position is 1167 and the previous request was served at 1250, computethe total distance (in cylinders) that the disk arm would move for each of the followingalgorithms: FIFO, SSTF, SCAN, and C-SCAN scheduling.9.16. Five batch jobs, A through E, arrive at a computer center at essentially the same time.They have an estimated running time of 15, 9, 3, 6, and 12 minutes, respectively. Their(externally defined) priorities are 6, 3, 7, 9, and 4, respectively, with a lower value cor-responding to a higher priority. For each of the following scheduling algorithms, deter-mine the turnaround time for each process and the average turnaround for all jobs.Ignore process switching overhead. Explain how you arrived at your answers. In thelast three cases, assume only one job at a time runs until it finishes, and all jobs arecompletely processor bound.a. round robin with a time quantum of 1 minuteb. priority schedulingc. FCFS (run in order 15, 9, 3, 6, and 12)d. shortest job first8.4. Consider the following page-reference string: a, b, d, c, b, c, d, b, d, b, a, c, b, c, a, c, f.a, f, d. Assume that there are 3 frames available and that they are all initially empty.Complete a figure, similar to Figure 8.14, showing the frame allocation for each of thefollowing page replacement policies:a. First-in-first-outb. Optimalc. Least recently usedThen, find the relative performance of each policy with respect to page faults.7.6. This diagram shows an example of memory configuration under dynamic partitioning.after a number of placement and swapping-out operations have been carried out.Addresses go from left to right; gray areas indicate blocks occupied by processes;white areas indicate free memory blocks. The last process placed is 2 Mbytes and ismarked with an X. Only one process was swapped out after that.4M MX 5M8M2M 4M3Ma. What was the maximum size of the swapped-out process?b. What was the size of the free block just before it was partitioned by X?c. A new 3-Mbyte allocation request must be satisfied next. Indicate the intervals ofmemory where a partition will be created for the new process under the follow-ing four placement algorithms: best-fit, first-fit, next-fit, and worst-fit. For eachalgorithm, draw a horizontal segment under the memory strip and label it clearly.

Question

Accepted Answer

We need to find available and need matrix and check for safety of the system.
*As per the guidelines…