Your company is working on a map application but and has run into a roadblock in their algorithm because finding the shortest route from point A to point B takes too long to be appealing to users. Upon further analysis, you realize that your algorithm often does unnecessary work by traversing paths that end up being worse than the current optimal path. What kind of algorithm can you use to fix this problem? nea a. Greedy b. Divide and Conquer c. Dynamic Programming d. Backtracking e. Branch and Bound