You are given an integer array cookies, where cookies[i] denotes the number of cookies in the $i^{ ext{th}}$ bag. You are also given an integer k representing the number of children to whom all cookie bags must be distributed.

Every bag of cookies must be given to exactly one child and cannot be split.

The unfairness of a distribution is defined as the maximum total number of cookies obtained by any single child in that distribution.

Return the minimum unfairness of all possible distributions.

Constraints:

• $2 \leq$ cookies.length $\leq 8$

• $1 \leq$ cookies[i] $\leq 10^5$

• $2 \leq$ k $\leq$ cookies.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.