Suppose that each row of an nx n array A consists of I's and O's such that, in any row of A, all the 1's come before any O's in that row. Assuming A is already in memory, describe a method running in O(n) time (not O(n2) time) for finding the row of A that contains the most l's