3. Readers/Writers Scenarios (16 points total – 8 points each). See attached algorithm on page 7. Circle the letters for

[answerhappygod]

3. Readers/Writers Scenarios (16 points total – 8 points each).
See attached algorithm on page 7. Circle the letters for all of the
choices that are true. It’s possible to have 0 or more true
choices. Scenario 1: Suppose W1 begins execution and finishes 1w.
Now R1 begins execution, how far can R1 get? Now W2 begins
execution, how far does W2 get? Now R2 begins execution, how far
does R2 get?
a) W1 is on the wrt queue.
b) W1 is on the mutex queue.
c) R1 is on the wrt queue.
d) R1 is on the mutex queue.
e) W2 is on the wrt queue.
f) W2 is on the mutex queue.
g) R2 is on the wrt queue.
h) R2 is on the mutex queue.
Scenario 2: Suppose R1 begins execution and finishes 6r. Then W1
begins execution, how far can W1 get? Next R2 begins execution, how
far does R2 get? Next W2 begins execution, how far does W2 get?
Next R3 begins execution, how far does R3 get?
a) W1 is on the wrt queue.
b) W1 is on the mutex queue.
c) R2 is on the wrt queue.
d) R2 is on the mutex queue.
e) W2 is on the wrt queue.
f) W2 is on the mutex queue.
g) R3 is on the wrt queue.
h) R3 is on the mutex queue.