Build your intuition. Fill in the missing part by typing it in.

A greedy algorithm is an algorithmic paradigm that follows the problem-solving heuristic of making the locally _ choice at each stage with the hope of finding a global optimum. The locally _ choice is called the greedy choice. In other words, a greedy algorithm makes the best choice at each step with the information it has at that moment, without worrying about the future. However, greedy algorithms may not always produce the ____ solution. Fill in the blanks to complete the statements.