Overview

You are given the following:

A list of food items, each with a number of calories.

A list of teams, each with a number of needed calories $($calculated based on the team size, type of sport, etc.$)$

You would like to prepare a package of food items for every team, such that the total calories of the items in the package equals exactly the needed calories by the team. Assume that:

You have an infinite supply of the items.

A package can have an item multiple times $($we care most about the total number of calories$).$

An item can't be broken into fractions.

Task # $1$

Implement the following function:

bool can$\_$package$($int items$[],$ int N$,$ int C$)$

This function returns true if there is a way to create a package using the given items, such that the total calories in the package equals exactly C$.$ The function returns false otherwise.

Task # $2$

Implement the following function:

void min$\_$items$($int items$[],$ int teams$[],$ int result$[],$ int N$,$ int M$)$

This function stores in result$[$i$]$ the minimum number of items needed to create a package for team

$$

i$,$ such that the total number of calories in the package equals exactly teams$[$i$].$

Note. Assume that there will always be a way to create a package for team

$$

i such that the total calories in the package equals teams$[$i$].$