Consider an n by n matrix M whose elements are 0s and 1s such that in any row, all the 1s come before any 0s in that row. Assuming A is already in memory, describe an efficient algorithm for finding the row of M that contain the most of 1s. What is the running time of the algorithm?