1).Definer-bounded waiting for a give nmutual exclusion algorithm to mean that if DJ DK ,then CSJ CSK+R IS there a way to define a doorway for the Peterson algorithm such that it AB provides R bounded waiting for some value of R?

2). Suppose N threads call the visit method of the Bouncer class shown in Figure 1. Prove that .

a) At most one thread gets the value STOP.

b) Atmost N-1 threadsgetthevalueDOWN.

c) At most N-1 threads get the value RIGHT.

Note that the last two proofs are not symmetric.