8. [25 pts] Given the following transportation problem, sending units from sources A,B, and C to destinations 1,2,3, and 4 : The supply amounts of each source are to the left of the letters; the demand amounts are above the numbered destinations. (a, 10 pts) Set up the initial tableau, using the northwest corner rule as the starting solution. (b, 15 pts) Perform one iteration of the transportation algorithm from class. Is the resulting solution optimal? 8. [25 pts] Given the following transportation problem, sending units from sources A,B, and C to destinations 1,2,3, and 4 : The supply amounts of each source are to the left of the letters; the demand amounts are above the numbered destinations. (a, 10 pts) Set up the initial tableau, using the northwest corner rule as the starting solution. (b, 15 pts) Perform one iteration of the transportation algorithm from class. Is the resulting solution optimal