gant chart for pre-emptive priority scheduling and for non-premptive priority scheduling

Analyze scheduling algorithms for the following five processes given the process CPU burst time, priority (lower number means higher priority) and arrival time. Arrival Processes Burst Time Priority Time P2 P4 For each of the following scheduling algorithms draw a Gantt diagram Calculate the total Wait time for each process, and calculate the average wait time