I want a correct solution please

Q3. The following table shows arrival time, CPU burst, and priority for each process. (5 Pts.) Process Arrival Time Burst Time Priority P1 0 8 3 P2 0 4. 5 P3 3 2 2 P4 6 3 4 WNI a) Draw Gantt charts for: I. First-Come-First-Serve, II. Priority Scheduling (preemptive). Hint a bigger priority number implies a higher priority b) For each scheduling algorithm mentioned in (a): 1. calculate waiting time for each process, II. average waiting time, III. turn-around time for each process