Question 8 to Question 10 is based on this problem. Amelia Williamson is a coordinator of the Gamma Chi Delta (GCD) sorority and wants each pledge to identify five existing members of GCD whom she would most like to have as a big sister. Amelia then asks the pledges to rank order these potential big sisters from 5 down to 1 , where 5 represents the person they most want as a big sister, 4 represents their next choice, and so on. These rankings are summarized in the following table: After much consideration, Amelia decides that this problem is similar to some of the problems she encountered in a business analytics class she took during her sophomore year. She knows that every pledge must be assigned a big sister, and each potential big sister can be assigned no more than one pledge. Ideally, Amelia wants to assign each pledge to the big sister to whom she gave a ranking of 5 . The sum of the rankings for such an assignment is 25 because each of the 5 pledges would be assigned to the big sister they ranked as number 5 . But in the previous table, that would involve assigning pledges 2 and 4 to the same big sister, which is not allowable. Amelia figures that the next best strategy is to determine the assignment that maximizes the sum of the rankings. Define the decision variables as follows: Xij=1 if pledge i is assigned big sister j;0 otherwise. Create a spreadsheet model for Amelia's problem and solve it. What is the coefficient of X36 in the objective function? 5 4 3 2 1 0 Which of the following constraints is true? A. X12+X22+X32+X42+X52=1 B. X18+X28+X38+X48+X581 c. X21+X22+X23+X24+X25=1 D. X81+X82+X83+X84+X851 Question 10 1 pts What is the optimal objective function value? 24 23 22 21 20