Hello, there I can understand the Gantt chart I think it's not the exact chart I was expecting. Kindly look into it again and I am attaching the example of the Gantt chart. Kindly send me in that format. Thanks, I really need your help.

2. Discuss the steps involved with their interactions. (5 Marks) Memory and Process Management (Total 50 Marks) 3. Given the following mix of job, job lengths, and arrival times, assume a time slice of four (4) and compute the completion time, turnaround time, and waiting time for each job. Draw the Gantt chart and suggest an application for each job. (Consider 5 as a highest priority and 0 as a lowest priority). ( 36 Marks) a. First Come First Serve (FCFS) algorithm b. Shortest Job First Scheduling (SJF) algorithm c. Shortest Remaining time (SRT) algorithm d. Non-preemptive priority Scheduling algorithm e. Preemptive priority Scheduling algorithm f. Round-Robin Scheduling algorithm 2. Discuss the steps involved with their interactions. (5 Marks) Memory and Process Management (Total 50 Marks) 3. Given the following mix of job, job lengths, and arrival times, assume a time slice of four (4) and compute the completion time, turnaround time, and waiting time for each job. Draw the Gantt chart and suggest an application for each job. (Consider 5 as a highest priority and 0 as a lowest priority). ( 36 Marks) a. First Come First Serve (FCFS) algorithm b. Shortest Job First Scheduling (SJF) algorithm c. Shortest Remaining time (SRT) algorithm d. Non-preemptive priority Scheduling algorithm e. Preemptive priority Scheduling algorithm f. Round-Robin Scheduling algorithm