Consider a distributed system consisting of three computers $x,Y,$ and $Z.$ When $x\text{'}$s clock is

showing $2$:$00$ the time shown respectively in $Y\text{'}$s and $Z\text{'}$s clocks are $1$:$55$ and $2$:$20.$ Assuming

$x$ to be the master for this distributed system, the Berkeley algorithm:

A$.$ Synchronises the clocks to $x=Y=Z=2$:$20$

B$.$ Synchronises the clocks to $x=Y=Z=1$:$55$

C$.$ Synchronises the clocks to $x=Y=Z=2$:$00$

D$.$ Synchronises the clocks to $x=Y=Z=2$:$05$

E$.$ Cannot be applied in this case