30] 2. For each of the following problems and greedy approaches, provide an example of an instance where the approach fails. A. For the 0-1 knapsack problem, repeatedly selecting from the remaining items, the lightest item (ui s minimum that could fit in the knapsack. B. For the 0-1 knapsack problem, repeatedly selecting from the remaining items, the most valuable item (vi is maximum) that could fit in the knapsack. C. For the fractional knapsack problem, repeatedly selecting from the remaining items, all (or as much as possible) of the lightest item until the knapsack is full