Which one is true for the Greedy Algorithm for $0/1$ Knapsack Problem?

a$.$

Finds the global optimum for any input instance.

b$.$

The volume$-$to$-$value is the greedy selection ratio.

c$.$

Generates a local optimum in polynomial time.

d$.$

It runs in exponential time when it finds the global optimum.