Exercise $2\mathrm{.}1.$ A mutual exclusion algorithm provides r$-$bounded waiting if there is a way to define a doorway such that if DA $->$ Dig, then CS

B$,$ then CS$,->$ Csktr$.$ Does the

Peterson algorithm provide r$-$bounded waiting for some value of r$?$