VI$.$ The following pseudocode $($next page$)$ is a correct implementation of the producer$/$consumer problem with a bounded buffer:

Labels p$1,$ p$2,$ p$3$ and c$1,$ c$2,$ c$3$ refer to the lines of code shown above $($p$2$ and c$2$ each cover three lines of code$).$ Semaphores empty and full are linear semaphores that can take unbounded negative and positive values. There are multiple producer processes, referred to as $Pa,Pb,Pc,$ etc., and multiple consumer processes, referred to as $Ca,Cb,Cc,$ etc. Each semaphore maintains a FIFO $($firstin$-$first$-$out$)$ queue of blocked processes. In the scheduling chart below, each line represents the state of the buffer and semaphores after the scheduled execution has occurred. To simplify, we assume that scheduling is such that processes are never interrupted while executing a given portion of code $p1,$ or $p2,$dots, or $c3.$ Your task is to complete the following chart $($only run $1$ section per line in the chart, multiple sections per line is a special case that you are not supposed to use$).$

Hint: All processes in this problem will execute $1$ section of the code once then continue to the next $($i$.$e$.$ Ca executes c$1),$ unless it is blocked by a semaphore. Update the section of the code executing, the full semaphore value and queue of process names,