For a Linear Programming Problem, find min \( Z = 5x + 3y \) (where \( Z \) is the objective function) for the feasible region shaded in the given figure.
Show that the line passing through the points A $(0, -1, -1)$ and B $(4, 5, 1)$ intersects the line joining points C $(3, 9, 4)$ and D $(-4, 4, 4)$.