EXERCISE 2.2. We are given three (primitive) processes P1, P2, and P3 with shared integer variable x. The program of process P;is as follows: Algorithm 1 Process Pi for ki = 1, ...,10 do LOAD(x); INC(x); STORE(2); od That is, Pi executes ten times the assignment x := x+1. The assignment x := x+1 is realized using the three actions LOAD(x), INC(x) and STORE(x). Consider now the parallel program: Algorithm 2 Parallel program P X := 0; P1 || P2 || P3 Question: Does P have an execution that halts with the terminal value x = 2? EXERCISE 2.2. We are given three (primitive) processes P1, P2, and P3 with shared integer variable x. The program of process P;is as follows: Algorithm 1 Process Pi for ki = 1, ...,10 do LOAD(x); INC(x); STORE(2); od That is, Pi executes ten times the assignment x := x+1. The assignment x := x+1 is realized using the three actions LOAD(x), INC(x) and STORE(x). Consider now the parallel program: Algorithm 2 Parallel program P X := 0; P1 || P2 || P3 Question: Does P have an execution that halts with the terminal value x = 2