Maximum Product Cutting Problem: Given a rope of length n inches, cut the rope in different parts of integer lengths in a way that maximizes product of lengths of all parts. You must make at least one cut. Assume that the length of rope is more than 2 inches. For example, n=4, maximal product: 2*2 = 4 n=10, maximal product: 3*3*4 = 36 1. Determine a recursive formula for the maximal product. 2. Implement the recursive solution in pseudocode.3. Using dynamic programming, implement a bottom-up non-recursive solution in pseudocode.4. Implement an extended bottom-up solution to compute the cuts associated with the maximal products.5. Implement a procedure to print the lengths of all parts corresponding to the maximal product.