How is the stable set polynomially reducible to set packing, where set packing is the decision problem related to finding a maximum weight set of disjoint columns in a 0–1 matrix?

a) Through a polynomial-time algorithm
b) By transforming stable set instances into set packing instances
c) By creating a bipartite graph representation
d) By utilizing dynamic programming techniques