In the graph, the feasible region representing the Linear Programming Problem for maximising objective function $Z = px + qy$, $p, q > 0$ is shaded. If all points on segment AB give max (Z), then which of the following is true ? (A) $p = 2q$ (B) $p = 3q$ (C) $q = 3p$ (D) $q = 2p$