Semaphore R=1, S = 3, T = 0; /* initialization */ /* process 1 */ while ( true ) { P(S); printf ('A'); } /* process 2 */ while ( true ) { printf

Semaphore R=1, S = 3, T = 0; /* initialization */

() {P(S);('A');}() { ('B'); ('C');V(T); }}() {P(T); ('D');V(R);}() {P(R); ('E');V(T);}

How many A and B's are printed when this set of processes runs?

1. 2As and 3B
2. 3As and any Bs
3. 1A and 0B
4. Any As and any Bs

Which is the following output sequence is possible when this set of processes runs?

1. AEBCBCDAA
2. AAABCBCBE
3. AAEBCDEAA
4. EDEDBCAAA