Question $3$: Greedy Strategy Knapsack $(20$ points$)$

You are given n items, each with a weight wi and a value vi$,$ and a knapsack that can hold a maximum weight of W $=100.$ Your task is to select a combination of items to maximize the total value in the knapsack while ensuring that the total weight does not exceed W$.$ Use the following information.

Profit: $\{10,20,30,40,50\}$ Weights: $\{20,30,66,40,60\}$

Detailed Instructions

$1.$ Greedy Strategy: $10$ points

Implement the greedy method to solve the Fractional Knapsack problem.

$2.$ Algorithm Steps: $10$ points

Describe the steps of the greedy algorithm in detail, including how you select the next item to add to the knapsack and how you handle fractions.