you are given an integer matrix A of dimension N$*$N$,$ such that each row in A is sorted in increasing order and each column in A is sorted in increasing order. Assume that you have a distributed computing system with N nodes. You have to find the minimum value in A

a$)$ specify your solution using map and reduce operations

b$)$ calculate the number of basic steps in your solution, You may assume that a function min$($x$,$y$)$ to compute the minimum of x and y in $1$ basic step is available

c$)$what is the speedup obtained?

d$)$ Suppose your system has only P compute nodes$($instead of N$)$ for some P