This is basic algorithms...

(5 + 2 points) Consider a word wrap problem again. Assume that our text editor does not leave all the extra space to the right but equally distibutes the space between the end of the line and the spaces between the words. Thus, the fee for a line with word:s of length l1,... , lk and the maximum line width l will be not (e-l which we used in the lecture but W lk -k+1 Design an algorithm that takes an array of n words and the maximum line width l and outputs the minimum possible fee for splitting these words into lines The complexity of the algorithm must be O(n2) (3 + 1 points) Improve an algorithm from the previous problem to return not the minimum possible fee, but the actual split of the words into lines. The complexity of the algorithm must be O(n2)