2. Assume there are 6 processes with id, arrival time and burst time as shown below (see Table 2). Table 2 1 UNITAR a) Based on the above information, Draw a Gantt chart for the following algorithms: i. Round-Robin (Time Quantum: 3 milliseconds) ii. Shortest Remaining Time (SRT) ( 8 Marks) (7 Marks) iii. First-come-First Serve (FCFS) iv. Shortest Job First [SJF] (6 Marks) (6 Marks)