Can someone please help me with this problem? Please show work.

Given the arrival of 3 processes P1,P2,P3, in this order, 5 clock intervals apart, P2 arrives at 5 and so on, starting at time 0, in that order, with the execution times of 15,6,3 respectively. Using the Non-preemptive Priority algorithm, generate a Gantt chart and use the chart to answer the following parts: Keep in mind that the processes have the following priorities: P1 - 2, P2 - 3, P3 - 1.

a.) list the order of execution of these processes (use the names of the processes)

b.) what is the exit time of each of those processes?

c.) what is the wait time of each of the processes?

d.) between which two processes does priority inversion occur and at what time interval?