Consider the following set of processes with sequence of CPU and I$/$O bursts. A arrives at t$=0,$ and B and C arrives at t$=5.$ The length of the CPU burst time and I$/$O burst time are given in the parentheses: A: CPU burst $(10)$ I$/$O burst $(2)$ CPU burst $(10)$ B: CPU burst $(3)$ I$/$O burst $(4)$ CPU burst $(2)$ C: CPU burst $(2)$ I$/$O burst $(3)$ CPU burst $(2)1)$ Draw the Gantt charts that illustrate the execution of these processes using scheduling algorithms FIFO and preemptive SJF$).2)$ Calculate the CPU utilization, average turnaround time, average wait time, and average throughput for both scheduling algorithms