Please I need answer asap please. Make sure clear picture of all answer.

Three processes and their lengths are: P1 = 3, P2 = 2, P3 = 1. They arrive at times 0, 1 and 2, respectively. Assume FIFO (first-in, first-out) CPU scheduling without preemption. Draw the Gantt chart (timeline) of process execution. Calculate the wait time for each process: in the above example, identify and list all time periods when a process is ready