write a c++ for the following. donot copy from other sites. Solve this question without using pointers. Take a Boolean 2D array of 10X10, where each row is sorted from the user, Find the row with the...

write a c++ for the following.

donot copy from other sites. Solve this question without using pointers.

Take a Boolean 2D array of 10X10, where each row is sorted from the user, Find the row with the

maximum number of 1s.
Example:
Input matrix
0 1 1 1
0 0 1 1
1 1 1 1 // this row has maximum 1s
0 0 0 0
Output: 2