Consider the Fractional and Binary Knapsack problems and their greedy solution methods. Which one is true? Select one: a.For the same input, one expects to have Fractional Greedy Ratio of , an item = Binary Remaining Volume. c. For the same input, one expects to have Fractional Total Value >= Binary Total Value. d.For the same input, one expects to have Fractional Total Iterations