4) (2pts) Your company is working on a ridesharing service that matches multiple users together for short rides to their locations. It does this by trying every possible assignment of carpooling riders for all requests in a 15 minute window, and choosing the one that causes people to get to their destinations as fast as possible on average. Upon further analysis, you realize that your program spends almost all of its time measuring the waiting times for rideshare arrangements that end up being much worse than the optimal arrangement. What kind of algorithm can you use to fix this problem? a. Greedy b. Divide and Conquer c. Dynamic Programming d. Backtracking e. Branch and Bound