Extra Credit: You have a set of N boxes, where each box B, has mi pieces of fruit. Each box contains a specific type of fruit- e.g., bananas, apples, mangos- and no two boxes have the same type of fruit. Design a dynamic programming algorithm to determine how many ways are there to select M fruits (e.g., if you are trying to select 5 fruits, an option would be 2 bananas and 3 apples, or 4 mangos and 1 banana). You can select at most mi pieces of fruit from box B Extra Credit: You have a set of N boxes, where each box B, has mi pieces of fruit. Each box contains a specific type of fruit- e.g., bananas, apples, mangos- and no two boxes have the same type of fruit. Design a dynamic programming algorithm to determine how many ways are there to select M fruits (e.g., if you are trying to select 5 fruits, an option would be 2 bananas and 3 apples, or 4 mangos and 1 banana). You can select at most mi pieces of fruit from box B