1- Given the following arrival times and CPU cycle times. Job/Process A B C D E Arrival Time O 3 4 7 12 CPU Cycles Required / Service Time 3 8 3 14 2 Priority 3 (Silver) 2 (Gold) 1 (Diamond) 2 (Gold) 2 (Gold) a) Draw a timeline (Gantt-Chart) for each of the following scheduling algorithms b) What is the Waiting Time and Turnaround Time of each process for each of the scheduling algorithms? (Details of the calculation is essential). i) First-Come-First-Served (FCFS) ii) Round Robin (RR) (use time quantum of 3) iii) Highest Response Ratio Next (HRRN) Shortest Remaining Time (SRT) v) Shortest Process Next (SPN) 2- Using either internet resources or books, understand the concept of Memory Management and Virtual Memory. Define those terms (Memory Management and Virtual Memory) in your own words. You must provide references and cite the sources that you consulted for this task. (Harvard referencing is the required method.) 3- Consider the directed resource graph shown below and answer the following questions: Is this system deadlocked? a. b. Which, if any, processes are blocked? C. What is the resulting graph after reduction? R1 R2 R3 R4 P1 P2 P3