Give the brute-force solution to the knapsack problem with weight capacity of 10 and Weights= { 5, 4, 6,3} and corresponding values= {10, 40, 30, 50}. What is the worst case time complexity of this algorithm? TTTF Paragraph %DO Q fx Mashups - 16 Arial E 3 (12pt) - E - T- SE T' T: 035 qr --- E E O I HTML CSS Path:p Words:0