Please help asap! Detailed and relevant answers

Task 4. Given a rectangle C containing treasures with positive integer values. We start from the bottom left corner and go to the top right corner. We can go to the right or up. We want to collect the maximal treasure. Give a greedy 1 | 5 | 3 | 6 | c#code that aims to find the amount of the maximal treasure. 11 2 151 6 10 20 9 jell 1 | 3 | 4 | 8 J-1 2 3