Menu Bundle Minimum Cost

Given a list of menu bundles with prices and the foods they contain, find the minimum cost to get all wanted foods.

Example: ` Bundles:

• (burger, $50)
• (fries, $30)
• (burger+wings, $70)
• (fries+wings, $60) Wanted: [wings, fries]

Output: $60 (buy fries+wings bundle) `

Requirements:

• Each bundle contains 1+ food items
• Can buy multiple bundles
• Must cover ALL wanted foods (duplicates okay)
• Return minimum total cost

Approach: Use DP with bitmask where each bit represents whether a food item is obtained.

Follow-ups:

1. Return the actual combination of bundles to buy
2. Limit to at most k bundles
3. Handle bundle quantity limits