Given the scenarios in a distributed computation as depicted below that involves 3 processes P₁, P₂, and P₃, where bank accounts A, B, and C are maintained and processed, respectively. Initially the accounts have: A=300, B=400, and C=200. Assume the system supports FIFO communications.

Apply the Chandy-Lamport global state recording algorithm for each of the following initiations, and show every recording when and where the recording takes place:

1. P₁ initiates global state recording at point 1, and the marker from P₁ arrive at points marked as 1 on P₂ and P₃.

2. P₃ initiates global state recording at point 3, and the marker from P₃ arrive at points marked as 3 on P₁ and P₂.

Pr 10 5 P2 20 50 10 P3 Pr 10 5 P2 20 50 10 P3