in cpp

1 #include Nm in using namespace std; 4 5 6 class node { int value; node* next; 7 8 9 10 11 12 I public: node(int value, node* next) { this->value value; this->next next; } 13 = 14 15 16 17 18 19 void print) { node* current this; 16 17 18 void print() { node* current - this; 19 20 21 22 while (current != nullptr) { cout value next; } SN99 } 1/Add the value end at the end of the list (i.e. after the last element) void add(int n) 29 // Your code starts here 31 32 7/ Your code ends here 33 34 55 //Return the sum of all the elements in the list 34 35 36 //Return the sum of all the elements in the list int sum) { // Your code starts here 37 38 39 40 // Your code ends here 41 } 42 43 //Multiplies each element in the list by n void mult(int n) { // Your code starts here // Your code ends here 44 45 46 47 48 49 50 51 52 53 } //Find the maximum value in the list int max() { sue 42 43 44 //Multiplies each element in the list by n void mult(int n) { // Your code starts here 45 46 47 48 49 // Your code ends here } 50 51 52 7/Find the maximum value in the list int max() { // Your code starts here 53 54 55 // Your code ends here 56 57 } 58 59 6e //After