Consider the Fractional and Binary Knapsack problems and their greedy solution methods. Which one is true?

a$.$ For the same input, one expects to have Fractional Remaining Volume $>=$ Binary Remaining Volume.

b$.$ For the same input, one expects to have Fractional Total Iterations Binary Total Iterations.

c$.$ For the same input, one expects to have Fractional Greedy Ratio of an item Binary Greedy Ratio of an item.

d$.$ For the same input, one expects to have Fractional Total Value $>=$ Binary Total Value.