17) A company deals with three products A, B and C. They are to be processed in three departments X, Y and Z. Products A require 2 hours of department X, 3 hours of department Y and product B requires 3 hours,2 hours and 4 hours of department X, Y and Z respectively. Product C requires 2 hours in department Y and 5 hours in department Z respectively. The profit contribution of A, B and C are $ 3, $ 5 and $ 4 respectively. Find the optimal product mix for maximizing the profit by simplex algorithm. In the coming planning period, 8 hours of department X, 15 hours of department Y and 10 hours of department Z are available for production.