Draw a timeline for each of the following scheduling algorithms. (It may be helpful to first compute a start and finish time for each jobs. a. FCFS b. SJN c. SRT D. Round robin (using time quantum of 5, ignore context switching and natural waist) JOB    ARRIVAL TIME    CPU CYCLE A                 0                             10 B                 2                             12 C                 3                               3 D                 6                               1 E                 9                              15 Saathi ho yeso help garna paryo yestai type ko question exam aahucha re...aafu lai kahi garnai aayena....yeso help paya danya hunthiyo....danyabaad