Consider an instance of the Knapsack Problem without repetitions with $4$ items, having weights and values as follows. The weights $($in pounds$)$ are w$1=2,$ w$2=2,$ w$3=4,$ w$4=5.$ The dollar values of these items are respectively p$1=2,$ p$2=8,$ p$3=12,$ p$4=10.$ The capacity of the knapsack is $8.($a$)$ Find the optimal solution for Fractional Knapsack. $($b$)$ Find the optimal solution for $0-1$ Knapsack