Describe and compare both the depth-first and breadth-firstsearch as a graph traversal. Also, describe under what conditionsor which problem each is best utilized to solve. Finallyincorporate a description of how such traversals are implemented asgreedy algorithms.