b$.$ Consider an algorithm using a collision CRCW model and $10$ processors. Following table represents the $10$ processors, the memory location each processor will write to and the data that will be written to the respective memory locations.

Also, let the old data in memory locations $m1,m2,m3,m4,m5,m6$ and $m7$ be $100,40,170,20,90,12$ and $38$ respectively.

Explain briefly, how the above task will be accomplished if we have $4$ processors. Show all the steps.

$\backslash$table$[[$Processor$,p1,p2,p3,p4,p5,p6,p7,p8,p9,p10$