Given the following information: a) Draw a timeline for each of the following scheduling algorithms. i. First Come First Served (FCFS) ii. Shortest Job First (SJN) iii. Shortest Remaining Time (SRT) iv. Round Robbin (using a time quantum of 4 , ignore context switching and natural wait) (20 marks) b) In addition, compute the average waiting time and average turnaround time for each of the algorithms and determine which one gives the best results