Solve the following linear program using the decomposition principle: minimize z = ?2x1 ? 5x2 subject to x1 + 2x2 = 13.5 x1 + 3x2 = 18.0 x1 ? 9 x2 ? 5 x1, x2 ? 0. Let the first two constraints be the hard constraints and the remaining constraints be the easy constraints. As an initial basis use the extreme points (0, 0)T, (0, 5)T, and (9, 5)T. (These are extreme points for the easy constraints in their original form, without slack variables.)