IN C$++$

$4{(}^{****}).$ 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.

Incorrect

Correct

The number of 'ones' in a group must be a power of $2.$ A group can contain:

$16(=2^4)or8(=2^3)or4(=2^2)or2(=2^1)or1(=2^0)$ cells

Incorrect

Correct

Grouping is carried$-$on in decreasing order meaning, one must try to group for $8($octet$)$ first,

then for $4($quad$),$ followed by $2$ and lastly for $1($isolated 'ones'$).$

Incorrect

Correct