5. (Extra credit, worth 0.5 problems on this assignment = 0.5 total points in the class.) Jersey Ike is aiming to enter the Guinness Book of World Records with the fastest and most massive delivery of sandwiches to customers in a single location. The company's strategy is to set up a VERY long service counter, with K Jersey Ike employees standing behind it. Before the timer starts, N customers take their places side by side at the counter, and place their sandwich orders. For each sandwich, it is known how much time is required to make the sandwich (all of the Jersey Ike employees are identically fast on all sandwich types). Jersey Ike must assign its employees to contiguous sections of the counter, so as to minimize the time required to make all of the customers' sandwiches. (In other words, a single employee cannot make the sandwiches of, say, customers 13, 22 and 57. But, a single employee could be assigned to make the sandwiches of customers 13, 14 and 15.) Also, the sandwich-making must respect a core value of the Jersey Ike company, namely, that any given sandwich must be made by exactly one employee. Devise an efficient algorithm that determines how Jersey Ike should optimally assign sections of the counter (i.e., contiguous intervals of customers) to its K employees