Show me the steps to solve Consider the following set of processes, with the length of the CPU$-$burst time given in milliseconds:

In addition to the processes listed above, the system also can enter an idle state $($which there is no consumption for CPU resources. This idle state identified as p$\_$idle$).$ This state should be appearing in drawing Gantt Chart whenever the system has no other available processes to run.

Each process is assigned a numerical priority, with a higher number indicating a higher relative priority.

For each of the scheduling algorithms:

A$.$ FCFS

B$.$ Preemptive, Round robin scheduling algorithm: The length of a time quantum is $10$ units. If a process is preempted by a higher$-$priority process, the preempted process is placed at the end of the queue.

$1.$ Draw a Gantt chart to show how these processes would be scheduled.

$2.$ Give the turnaround time $($total time from first arrival into ready state until cpu$-$burst is completed$)$ of each process.

$3.$ Give the waiting time $($total time spent in the Ready state$)$ of each process.

$4.$ Give the average waiting time of all the processes

$\backslash$table$[[$Process$,$burst Time,Priority,Arrival$],[$P$1,20,40,0],[$P$2,25,30,25],[$P$3,25,30,30],[$P$4,15,35,60],[$P$5,10,5,100],[$P$6,10,10,105]]$

Don't take the answer from chatGPT

Solve it using Gantt chart.