Consider a generator matrix G for a nonsystematic (6, 3) code: b- 0 1 1 1 1 0 1 1 0 1 0 100 0 1 1 1 Convert G to systematic form, then find H. Construct the code for this G, and show that dmin, the minimum distance between codewords, is 3. Consequently, this code can correct at least one error.