Given hit for problem: Define a shared variable sem with initial value of 1. In each process, define local variable a and b with initial value of 1 and 0, respectively. Invoke CSW with parameters (a, b, sem).

pseudo code is fine.

3.4 Suppose a computer has an atomic Compare-and-Swap instruction, which has the following effect: csW(a, b, c): ( if (a == c) { c = b; return (0); } else { a = c; return (1); }) Parameters a, b, and c are simple variables, such as integers. Using CSW, develop a solution to the critical section problem for n processes. Do not worry about the eventual entry property. Describe clearly how your solution works and why it is correct. 3.4 Suppose a computer has an atomic Compare-and-Swap instruction, which has the following effect: csW(a, b, c): ( if (a == c) { c = b; return (0); } else { a = c; return (1); }) Parameters a, b, and c are simple variables, such as integers. Using CSW, develop a solution to the critical section problem for n processes. Do not worry about the eventual entry property. Describe clearly how your solution works and why it is correct