MS 3053-Homework #5 Due Date: March 2, 2018 A law firm has six new cases for which it must conduct pre-trial preparations over the next week. To assist the attorneys with the preparation work, a legal assistant may be assigned to each case. There are currently Aive legal assistants with available time, and each legal assistant may only be assigned to one case. The time that ench legal assistant would need to devote to a case is based on his or her expertise with the particular type of case and how complex it is. The firm's gonl is to assign the legal assistants such that the total number of labor hours required to complete the entirety of the case preparation work is minimized. The table below provides the estimated times (in hours) the legal assistants will likely have to devote to the cases, based on their levels of experience and other factors. Case 1 Case 2 Case 3 Case 4 Case 5 Case 6 Arthur 22 26 21 Brenda Chris Diana Ewan 27 25 29 21 26 23 26 25 27 27 23 26 24 24 26 23 21 24 26 27 Let ,-{ 1, legal assistant i is assigned to case j 0, otherwise zij= i = A, B,C,D,E and j-1, 2, 3, 4, 5, 6. Formulate the problem as a binary programming model, and find the optimal labor allocation, i.e. determine which legal assistant the firm should assign to each case. (Include a print-out of your solved Excel spreadsheet.) Which case is not assigned a legal assistant (i.e., for which case will the attorney be responsible for the preparation work)