Return to the lists of problems in Table 14.1. For each of the following pairs of problems in the table, establish that the first, polynomially solvable one is a special case of the NP-Hard second, and identify the special properties of the first that prevent it from yielding worst-case instances of the second.

(a) (MST) vs. (Stein).

(b) (Asmt) vs. (GAsmt).

(c) (CPM) vs. (LPath).