Why does a greedy algorithm not use or require caching or memoization?

Question

a. Because it makes an optimum selection locally that reaches a global optimum
b. Because the greedy algorithm approach is recursive
c. Because it examines all possible solutions in the solution space
d. Because it recombines all the local optimal choices in the recombination step at the end

Answer 1

a. Because it makes an optimum selection locally that reaches a global optimum