Suppose that the bag class is efficiently implemented with a fixed array with a capacity of 4000, as in Chapter 3 of the class text. We execute these statements: bag b; b.inser b.insert (4) b.insert (6) b.erase_one (5); t (5) b.used is 2, b.data[O] is 4, b.data[1] is 6 b.used is 2, b.data[O] is 6, b.data[1] is 4 b.used is 3, b.data[O] is 4, b.data[1] is 6 b.used is 3, b.data[O] is 6, b.data[1] is 4 Give the output generated by the following code fragment: int a - 8; int b - 2 int "m - Sa; // address of a int "n-&b; // address of b m +b; //8+2 n- "mb; // 10+2 cout