The attached template has a $2-$dimensional array of $256$ numbers. The problem is to find the minimum value in the array, the first occurrence location $($row$,$ col$)$ of the minimum value, and the count the number of times it occurs.

In order to parallelize the computation, check for the minimum in each row in parallel. Then consolidate the results from each parallel computation making sure to lock appropriately so that the minimum and its occurrences are correctly combined.

The correct output should be displayed as:

array minimum is $1\mathrm{.}5$E$+000,$ first occurs at $(1,11)$ and occurs $6$ times

NUMBER OF PROCESSORS USED: $17$