A pirate is standing at the top of a NM table where each element in the table represents the number of golden coins he can collect. The rules are simple, the pirate starts at anywhere in the first row, and can only go down either straight, or to the left or to the right (if possible). His goal is to collect as many golden coins as possible. Find a way to help the pirate to do that using dynamic programming. For example, with the 45 table below 5 4 10 8 9 7 11 9 20 7 40 13 11 6 12 16 27 100 20 10 The best path would be as highlighted. Answer the following questions 1. How would you approach the problem? 2. What is your pseudo-code (java)? 3. What is the time complexity of your answer? 4. Is there any better solution than dynamic programming?