PLEASE ANSWER EACH PART AS TRUE OR FALSE

(H) Christian's algorithm for time synchronization assumes that network delays are asymmetric it ci- (J) The 1st stratum in NTP servers is directly connected to accurate time sources. (K) Messages in NTP bear timestamps of recent events. (L) Logical clocks encode causality relationships (M) Two events a and b are concurrent if a does not happen before b, and b happens before a (N) If a total order is needed for logical clocks, we can tie breaks using ids (H) Christian's algorithm for time synchronization assumes that network delays are asymmetric it ci- (J) The 1st stratum in NTP servers is directly connected to accurate time sources. (K) Messages in NTP bear timestamps of recent events. (L) Logical clocks encode causality relationships (M) Two events a and b are concurrent if a does not happen before b, and b happens before a (N) If a total order is needed for logical clocks, we can tie breaks using ids