(10%) Show that, we can find the minimum distance of a linear code from a parity- check matrix H for it. The minimum distance is equal to the smallest number of linearly-dependent column of H.