Given a rope of length n, write a function to determine how to cut the rope into m parts with length l[0], l[1], and so on until l[m] so that the product of each part is maximum. The rope needs to be...

Given a rope of length n, write a function to determine how to cut the rope into m parts with

length l[0], l[1], and so on until l[m] so that the product of each part is maximum. The rope

needs to be cut as an integer with a minimum of one cut.