give me the absolute correct answer to this question. There are three processes namely Pl$,$ P$2$ and P$3.$ These processes execute in synchronized manner

as shown below. Using counting semaphores and shared variables write the pseudocode for all the

three processes to achieving the desired synchronization.

P$1,$ P$1,$P$2,$ P$2,$ P$3,$P$3,$ P$1,$ P$1,$P$2,$ P$2,$ P$3,$P$3....$Q$4.$ There are three processes namely P$1,$ P$2$ and P$3.$ These processes execute in synchronized manner

as shown below. Using counting semaphores and shared variables write the pseudocode for all the

three processes to achieving the desired synchronization.

$P1,P1,P2,P2,P3,P3,P1,P1,P2,P2,P3,P3$dotsdots,