Test case 1:

Write the number of apples that Ramu has: 1341
Write the number of buyers: 5
Write family sizes: 
31 37 47 59 19
Write prices: 
49 50 46 55 52
Output of recursive implementation
Maximum earning is 73366. Selling pattern is
0, 0, 0, 1298, 38, 
Output of dynamic programming implementation
Maximum earning is 73366. Selling pattern is
0, 0, 0, 1298, 38, 

--------------------------------

Test case 2:

Write the number of apples that Ramu has: 1000
Write the number of buyers: 5
Write family sizes: 
13 17 19 23 29
Write prices: 
1 1 1 1 1
Output of recursive implementation
Maximum earning is 1000. Selling pattern is
949, 51, 0, 0, 0, 
Output of dynamic programming implementation
Maximum earning is 1000. Selling pattern is
949, 51, 0, 0, 0,

------------------------------------

Test case 3:

Write the number of apples that Ramu has: 1
Write the number of buyers: 10
Write family sizes: 
1 2 3 4 5 1 2 3 4 5 
Write prices: 
1 2 3 4 5 6 7 8 9 10
Output of recursive implementation
Maximum earning is 6. Selling pattern is
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 
Output of dynamic programming implementation
Maximum earning is 6. Selling pattern is
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 

--------------------------------------

Evaluation guielines:

4 marks each for correct output of each test case (total is 12)
10 marks each for logical correctness of each part (total is 20)
2 marks for efficiency of DP. O(n^3) gets full marks.
2 marks for neat and cleanliness
2 mark for indentation
2 mark for comments

Total is 40.