need correct ans. UPVOTE for SURE if it is right

(5 pts.) Let A be an nn matrix whose entries are all integers. Every column is sorted, but not necessarily every row. Assume the indices of the rows and columns start at 0 . We are interested in designing an algorithm that identifies the columns with the most number of negative integers. For example, for the matrix below, the algorithm should output {1,3} A=43051003560101341501812331. a. (1 pt.) Suppose the nn matrix A consists of positive integers only. What should the algorithm output? b. (4 pts.) Given matrix A, design an O(n)-time algorithm that outputs the indices of the columns with the most number of negative integers