You want to make a dessert and are given two integer arrays, baseCosts and toppingCosts, as well as an integer target.

To prepare the dessert, you must follow these rules:

• You must choose exactly $1$ base from baseCosts.

• You may choose $0$, $1$, or $2$ servings of each topping from toppingCosts.

Return the total cost of the dessert that is closest to target. If there is a tie, return the lower cost.

Constraints:

• n $==$ baseCosts.length

• m $==$ toppingCosts.length

• $1 \leq$ n, m $\leq 10$

• $1 \leq$ baseCosts[i], toppingCosts[i] $\leq 10^4$

• $1 \leq$ target $\leq 10^4$

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.