What is the main idea of the Greedy Heuristic for Binary Knapsack? Select one: a.Pick the item with the lowest value-to-volume ratio at each iteration. b.Pick the item with the highest remaining capacity at each iteration. c.Pick the item with the highest value-to-volume ratio at each iteration. OO d.Pick the item with the highest volume-to-value ratio at each iteration