DO NOT WRITE A CODE IT WILL BE GIVEN A THUMBS DOWN

Thanks

Given a rope of length n meters, 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 meters. Examples: nput: rope length is 4 4) Output: 2*2-4 (Maximum obtainable product is 2*2) nput: rope length is 5 n 5) Output: 2*3 = 6 (Maximum obtainable product is 2+3) Input: rope length is 10 (n = 10) Output: 3*3-4 36 (Maximum obtainable product is 3*3*4) 1 Design the recursive sub-problem condition(s) 2. Use your solution in (1) to solve the problem of a rope length input equals 10 (n 10). You have to show the complete solution of the DP steps either by top down or bottom-up approach. 3. What is the running time of your algorithm? Note: your solution must not run in exponential time