2. Consider a 3-processor multiprocessor connected with a shared bus that has the following properties: (i) centralized shared memory accessible with the bus, (ii) snooping-based MSI cache coherence protocol, (iii) write-invalidate policy. Also assume that the caches have a writeback policy. Initially, the caches all have invalid data. The processors issue the following five requests, one after the other. Create a table similar to that in slide 6 of lecture 25 to indicate what happens for every request. (35 points)

a. P1: Read X

b. P1: Write X

c. P3: Read X

d. P2: Read X

e. P3: Write X