A craftsman makes several different products. The amount he earns for making each type of product, and the time he will spend making them is shown in the following table. 4a duration (hours) 1 2 3 5 7 8 earned1 6 8 12 15 20 The craftsman has an 8-hour day to plan. Using a dynamic programming approach, compute his maximum possible earnings. Explain your method and show the intermediate amounts computed. b The Fibonacci numbers are defined as follows: Fo 0 F, = Fi-1 +Fi-2, when i > 1 i) Write an algorithm to compute Fibonacci number Fn using a top-down ursive) dynamic programming approach. You can use either Java or pseudocode. Write an algorithm to compute Fibonacci number Fn using a bottom-up (iterative) dynamic programming approach. You can use either Java or pseudocode ii)