Consider the following class declaration: class thing { private: int x; int y; static int z; public: thing() { x = y = z; } static void putthing(int a) { z = a; } }; int thing: : z = 0: assume a program containing the class declaration defines three thing objects with the following statement: thing one, two, three; a) how many separate instances of the x member exist? b) how many separate instances of the y member exist? c) how many separate instances of the z member exist? d) what value will be stored in the x and y members of each object?

3 instances of x member

3 instance of y member

3 instance of z member

Thing :: putThing(2)

Step-by-step explanation:

a) How many separate instances of y member

there are 3 instance of y member

b) How many separate instances of x member

there are 3 instance of x member

c) how many separate instance of the z member

there are 1 instance of  z

Statement Call put thing member function we get

Thing :: put thing()

left 3, up 4

step-by-step explanation:

just count the values of x & y of the vertex of the graph and see how many units in the x and y direction will get you from the f(x) graph to the f(x) graph

step-by-step explanation:

hans did not square the 40-unit side; he merely multiplied it by 2.   incorrect.