Consider a modification to the Chandy$-$Lamport algorithm where it is desirable to find a consistent

cut, and only record the local state at each process for the cut, and not the channel state. In this

modification, the initiator process records its state and sends a marker to all other processes. Each

process records its state upon receiving the marker from the initiator process. The algorithm terminates

when all processes have received a marker from the initiator process. Will this modification result in

a consistent cut? If yes, prove why. If not, present a counter$-$example. Assume all requirements for

Chandy$-$Lamport algorithm hold $($i$.$e$.$ each channel follows FIFO order, no messages are dropped, and

no process fails$).[2$ points$]$