Q2.3 4 Points Consider a network consisting of 5 computers, A (coordinator), B, C, D, and E. At 09:01 the coordinator decides to synchronise the clock of all computers in the network. The time format is HH:MM. At that moment, the clock of the computers in the network shows the following: B(08:53), C(09:02), D(08:56), E(09:03). Apply the Berkeley clock synchronisation algorithm to this situation, show the stages of computation, and explain the outcome of the synchronisation. The time needed for computation and for network communication is negligible. Enter your answer here Please select file(s) Select file(s) Save