What is greedy algorithm? You want to use greedy best first search algorithm to decide the order of questions to solve in an examination. How will you use it$?$ You want to modify to greedy second best first search $$ How will you do that? Write another algorithm where you select two top neighbors at every stage $$ Discuss about scenario where such an algorithm could make sense. Can it reduce chances of occurrences of global minima? Provide diagram and pseudocode.