A B D P1 F P2 H E G P3 J K L P4 M N O 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 4. (a) (4 points) Consider the timeline and events in Figure 4 again. Suppose that P3 initiates the Chandy-Lamport snapshot algorithm at (real) time 8. Assuming FIFO channels, write down all possible consistent cuts that the resulting snapshot could capture. You can describe each cut by its frontier events. (b) (6 points) Write all possible states of the incoming channels at P1 and at P4 that the above snapshot could record. You can denote each message by its send and receive event ids. A B D P1 F P2 H E G P3 J K L P4 M N O 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 4. (a) (4 points) Consider the timeline and events in Figure 4 again. Suppose that P3 initiates the Chandy-Lamport snapshot algorithm at (real) time 8. Assuming FIFO channels, write down all possible consistent cuts that the resulting snapshot could capture. You can describe each cut by its frontier events. (b) (6 points) Write all possible states of the incoming channels at P1 and at P4 that the above snapshot could record. You can denote each message by its send and receive event ids