Q6. (60 points) Consider the following processes, and arrival and burst times: A. (30 points) Draw the time charts that illustrate the execution of these processes using the following scheduling algorithms: SJF (non-preemptive shortest job first), preemptive SJF (shortest remaining time first), round robin (RR) with a quantum value of 5 . B. ( 30 points) What is the average waiting time experienced by all processes for all of the above cases given in the first part above