Trace the bottom-up tabulation Rod Cutting algorithm (below) on the following input: the following input: p[1..5] = 1, 5, 8, 9, 10 and n = 10. Draw the resulting table r[] (which stores the maximum revenue achievable for given rod length) and c[] which stores the first cut being made. A company buys long steel rods (of length n), cuts them into shorter ones to sell Rod Cutting Problem integral length only Selling price for rods of different length: length i price pi 1 1 2 3 4 5 6 7 8 9 10 5 8 9 10 17 17 20 24 30 Goal: maximize total revenue from selling these rods