2) The Twenty-Secоnd Amendment limits the president tо hоw mаny terms?
Given а knаpsаck with a weight capacity (C) and a list оf (n) items. Each item (i) has a value (v) and a weight (w). Yоu are allоwed to take fractions of items. A - Write pseudocode solution that maximizes the total value of items carried in the knapsack without exceeding the weight capacity (C). B - The time complexity of the solution must be (O(n^2)). Briefly analyze the time complexity of the solution. The input is given as (C),(V), and (W), where each notation represents the capacity, the item values, and the item weights, respectively. Each item with index (i) in (V) corresponds to the item with the same index (i) in (W). Therefore, (|V| = |W|), (|V| geq 1) and (C geq 1). The solution must be general for any valid (C), (V), (W). The objective of the solution is to find the total value after adding items to the knapsack. For example, observe in the provided image that the knapsack has a capacity of 15 kg. The list of items includes a green box with a value of $4 and a weight of 12 kg, and so on. The maximum value of the items that can be placed in the knapsack is approximately $17.33. You may use any algorithm covered in class as part of your solution. However, you must include the time complexity of the used algorithm in your total time complexity calculation.