Three processes P, Q, and R connected through bi-directional channels P<-->Q, Q<-->R, and R <--> P constantly rotate TWO messages L and K. L moves clockwise: from P to Q to R to P etc., while K moves counterclockwise. At any one time, there is only one copy of L and one copy of K in the system. Each process's state consists of a pair of counters (l,k) where l is the number of times the process has received L, and k is the number of times the process has received K. All counters are initially (0,0). At a certain point, suppose P has the message L, R has the message K and the states of P, Q, and R are respectively (7,4), (6,4) and (6,3). Immediately after sending L, P initiates the snapshot algorithm -- note that the snapshot marker m will follow message L. Explain the operation of the algorithm in this case, giving the snapshot reported by it. Do not forget the message(s) in transit. Assume lossless FIFO communication.