Which of the following is a characteristic of a greedy algorithm?A$)$ It always produces the optimal solutionB$)$ It makes decisions based on local optimizationC$)$ It uses dynamic programming principlesD$)$ It is always slower than other algorithms