Ex$.3[20$ pts$]$

Consider the following two programs. Insert semaphores such that only ACERO or ACREO is printed. Assume that there is exactly one process per proyam.

$(\backslash$left$.\backslash$left$|\backslash$begin$\{$array$\}\{$c$\}\backslash$mathrm$\{$P$\}1\backslash$

$\backslash$operatorname$\{$print$\}(\backslash$mathrm$\{$C$\})$ ; $\backslash$

$\backslash$operatorname$\{$print$\}(\backslash$mathrm$\{$E$\})$ ;$\backslash$end$\{$array$\}\backslash$right$|)$

$\backslash$table$[[P2$