Write a program that finds the minimal number of groupings in a matrix of bits. The size of a

grouping is determined by the number of $1\text{'}$s in it$.$ The rules in forming groups of ones are as follows:

$$ Each group should contain the largest number of 'ones' and no blank cells