Suppose that each row on an n $$ n array A consists of integers that are sorted in

ascending order $($from left to right in each row$).$ Also, suppose that the integers are

arranged so that the number of positive numbers in row i is at least the number in row

i $+1,$ for i $=0,1,...,$ n $2.$ Assuming A is already in memory, describe using

pseudocode $($for example, use commented low$-$level pseudocode$)$ a method that runs

in O$($n$)$ time $($not O$($n$2)$ time$)$ for counting the number of positive numbers in the

array A$.($Hint: draw a picture of the $2-$D array to help you devise the algorithm.$)$