Suppose we have five machines that are using the Berkeley algorithm for clock synchronization. The time daemon is running on machine MO. The other machines are named M1, M2, M3 and M4. The time readings on the five machines are as follows (twenty-four hour clocks are used). MO: 19:51 MI: 20:03 M2 19:27 M3 19:43 M4 20:21 In the third step of the algorithm, what are the values that the time daemon sends to each machine? Assume that the time values are expressed in minutes. These values are presented in a vector (value sent to Mo, value sent to M1 value sent to M2, value sent to M3, value sent to M4) none of these O (5, 17, -19,-3, 26) O(-5.-17, 19, 3.-26) (2.-10. 26, 10, -28) (0, -10,26, 10.-28)