Given 0-1 knapsack problem and fractional knapsack problem and the following statements:
$S_1$: 0-1 knapsack is efficiently solved using Greedy algorithm.
$S_2$: Fractional knapsack is efficiently solved using Dynamic programming.
Which of the following is true?
- $S_1$ is correct and $S_2$ is not correct
- Both $S_1$ and $S_2$ are correct
- Both $S_1$ and $S_2$ are not correct
- $S_1$ is not correct and $S_2$ is correct