$(15$ points$)$ The algorithm for computing the minimum of n numbers $62$ using n$^2$ processors in constant time uses: $($a$)$ Concurrent read in that in one step more than one processors read a single memory cell. $($b$)$ No concurrent read is needed. $($c$)$ Concurrent write in that in one step more than one processors write a single memory cell.