Define M[n, k] to be the minimum possible cost over all partitions of (81, ... , Sn) into k ranges. 1. Consider the input (100, 200, 300, 400, 500, 600, 700) with k = 3. What is M [7, 3]? (Hint: It should be possible to answer this by visual inspection.)