Update the code in main() that adds nodes to the list. Replace the lines shown below at the left with those on the right. if(infile. good()) { p = new node(name); p->put(cout); if(head==NULL) head = p; else q->add(p); q = p; }; ← if(infile. good()) { p = new node(name); p->put(cout); if(head==NULL) head = p; else head->add(p); }; If head is NULL, then the list is empty and head is set to p. Otherwise, head is used to call the add() function.

Pp 4.1 design and implement a class called sphere that contains instance data that represents the sphere’s diameter. define the sphere constructor to accept and initialize the diameter and include getter and setter methods for the diameter. include methods that calculate and return the volume and surface area of the sphere (see pp 3.5 for the formulas). include a tostring method that returns a one-line description of the sphere. create a driver class called multisphere, whose main method instantiates and updates several sphere objects.

Suppose s, t, and w are strings that have already been created inside main. write a statement or statements, to be added to main, that will determine if the lengths of the three strings are in order by length, smallest to largest. that is, your code should determine if s is strictly shorter than t, and if t is strictly shorter than w. if these conditions hold your code should print (the boolean value) true. if not, your code should print false. (strictly means: no ties) example: if s, t, and w are "cat", "hats", and "skies" your code should print true - their lengths are 3-4-5; but if s, t, and w are "cats" "shirt", and "trust", then print false - their lengths are 4-5-5 enter your code in the box below

If joey was single and his taxable income was $9,500, how much would he pay in taxes each year?