For the given scenario what algorithm strategy would you use $($DP$,$ Greedy, Brute force, Dive and conquer$).$ If it is to find shortest path which graph algorithm, would you use?

You are the manager of a conference and have a list of talks with their start and end times. Your goal is to schedule the maximum number of talks without overlapping.

You manage a warehouse with limited storage space. You have a list of items, each with a value and size, and you must decide which items to store to maximize the total value.

A hospital is handling a health emergency and must allocate doctors to patients. Each doctor can treat a limited number of patients, and each patient has a priority level.

You are a courier planning to deliver packages. Each delivery has a specific weight, a location, and a time window. The goal is to minimize fuel usage while ensuring all deliveries are made within the specified time windows.

You are managing a project with a set of tasks. Each task has a deadline, and a profit associated with it$.$ Only one task can be completed at a time, and your goal is to maximize the total profit.

You are an engineer tasked with designing a network of cables to connect several cities. Each cable has a cost, and your goal is to minimize the total cost while ensuring all cities are connected.

You have a fixed budget to invest in a series of projects. Each project has a cost and an expected return. Your goal is to maximize the total return without exceeding the budget.

You are solving a maze with multiple rooms connected by doors. Each door has a cost to pass through, and you need to find the cheapest path from the start to the exit.

You are organizing a holiday trip and have a compilation of activities along with their corresponding durations and levels of enjoyment.

Selection Sort.