Consider the following code. The legal codewords are those 32-bit sequences in which the number of 1-bits is divisible by 6. That is, a codeword is legal if it is 32-bit long, and of these bits the number of 1-bits is 0, 6, 12, 18, 24, or 30. How much is the Hamming distance of this code, and how many single bit errors can this code detect and correct?

What is the output of the following program? #include using namespace std; class bclass { public: void print() const; bclass(int a = 0, int b = 0); //postcondition: x = a; y = b; private: int x; int y; }; class dclass: public bclass { public: void print() const; dclass(int a = 0, int b = 0, int c = 0); //postcondition: x = a; y = b; z = c; private: int z; }; int main() { bclass bobject(2, 3); dclass dobject(3, 5, 8); bobject. print(); cout < < endl; dobject. print(); cout < < endl; return 0 ; } void bclass: : print() const { cout < < x < < " " < < y < < endl; } bclass: : bclass(int a, int b) { x = a; y = b; } void dclass: : print() const { bclass: print(); cout < < " " < < z < < endl; } dclass: : dclass(int a, int b, int c) : bclass(a, b) { z = c; }