Given a Fractional knapsack problem, the preferred way of solution strategy will be1 pointBrute ForceDynamicGreedyAny one of these

The preferred way of solving a Fractional Knapsack problem is using the Greedy strategy.

Here's a step-by-step guide on how to solve it:

1. First, calculate the ratio (value/weight) for each item in the knapsack.

2. Sort all items based on their ratios in decreasing order. This means the item with the highest ratio should be considered first.

3. Start picking items from the sorted list, starting from the first item. Keep adding as much of each item as possible until the total weight does not exceed the capacity of the knapsack.

4. If adding the entire item exceeds the capacity, add a fraction of it so that the total weight equals the capacity of the knapsack.

5. The total value of items in the knapsack is the solution to the problem.

This strategy works because the Greedy approach aims to make the optimal choice at each step as it attempts to find the overall optimal solution to the problem. In the Fractional Knapsack problem, the Greedy strategy provides an optimal solution.