Implement both of the following algorithmic problems. Problem 1: Minimum daily shipping capacity You are given an array `weights` of positive integers. Packages must be shipped in the given order. Each day, you load packages from left to right until adding the next package would exceed the ship's capacity. The remaining packages are shipped on later days. Given an integer `days`, return the minimum ship capacity needed to deliver all packages within `days` days. Problem 2: Minimum cost with bundle offers You need to buy `n` kinds of items. Array `price[i]` gives the individual price of item `i`. Each special offer is an array of length `n + 1`: the first `n` values are quantities of each item in the bundle, and the last value is the bundle price. Given `price`, `special`, and `needs`, return the minimum total cost to satisfy `needs` exactly. You may buy any offer multiple times, but you may not purchase more of any item than needed.