a$.$ Consider a parallel algorithm for sorting an array of $\text{'}n\text{'}$ elements comparison based sorting. The algorithm runs in $\text{'}n\text{'}$ steps such that step $1$ ha instructions that can be executed in parallel and all the remaining steps have n$\text{'}$ instructions. Suppose the algorithm uses $\text{'}n\text{'}$ processors. Is the algor optimal? If not, can you make it optimal? Justify your answer.

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

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.