Each of the following problems describes an algorithm implemented on a computer satisfying the axioms (13.5) and (13.7). for each one, state whether the algorithm is backwad stable, stable but not backward stable, or unstable, and prove it or at least give a reasonably convincing argument. be sure to follow the definitions as given in the text. (a) data: x e c. solution: 22, computed as x q x. (b) data: x e c. solution: x2, computed as x @ x. (c) data: x e c \{o). solution: 1,computed as x @x. (a machine satisfying (13.6) will give exactly the right answer, but our definitions are based on the weaker condition (13. (d) data: x e c. solution: 0,computed as x x. (again, a real machine may do better than our definitions based on (13.

Consider the following declarations (1, 2, 3, 5, 7)class bagtype{public: void set(string, double, double, double, double); void print() const; string getstyle() const; double getprice() const; void get(double, double, double, double); bagtype(); bagtype(string, double, double, double, double); private: string style: double l; double w; double h; double price; }; a.) write the definition of the number function set so that private members are set according to the parametersb.) write the definition of the member function print that prints the values of the data membersc.) write the definition of the default constructor of the class bagtype so that the private member variables are initialized to "", 0.0, 0.0, 0.0, 0.0, respectively d.) write a c++ statement that prints the value of the object newbag. e.) write a c++ statement that declares the object tempbag of type bagtype, and initialize the member variables of tempbag to "backpack", 15, 8, 20 and 49.99, respectively