Suppose that each row of an n x n array A consist of 1's and 0's such that in any row of A, all the 1's come before any 0's in that row. Assuming A is already in memory, describe a method running in O(nlogn) time (not O(n2) times!) for counting the number of 1's in A.

Provide pseudo-code, correctness, and complexity analysis.