For (b), the assignment y = y x is implemented by 4 atomic actions. Also you should give at least one scenario for each set of final values of x and y.

2.10 Consider the following program: int x = 0, y = 0; co x = x + 1; x = x + 2; 17 x = x + 2; Y = Y (a) Suppose each assignment statement is implemented by a single machine instruction and hence is atomic. How many possible histories are there? What are the possible final values of x and y? (b) Suppose each assignment statement is implemented by three atomic actions that load a register, add or subtract a value from that register, then store the result. How many possible histories are there now? What are the possible final values of x and y