Argue using the Mapping Rule (that is, without reference to the precise function in Figure 9.26) that for the Hamming Code’s parameters (n = 7 and k = 4) that there exists a bijection decode : P({1,...

Argue using the Mapping Rule (that is, without reference to the precise function in Figure 9.26) that for the Hamming Code’s parameters (n = 7 and k = 4) that there exists a bijection decode : P({1, 2, . . . , n − k}) → {0, 1, 2, . . . , n}.