There is a lot of code given to help with the implementation, I placed all the code that was given in a google document if that is okay with the solver. https://docs.google.com/document/d/1yWAHhROAxKHsg7n9tiAiOG2hT3-dRXhwLntDKcKX9uY/edit?usp=sharing

PART B-Linked Bag. 20 points Please change only files: LinkedBag340.cpp and Include.h, no other files. We are to implement 8 small additional functions and 2 helper functions to the Linked Bag. Our programs must produce identical output to the output in the 2 sample runs: Asmt03_Runl.txt and Asmt03_Run2.txt Our Test 9's output must also be identical to the sample output excepts the random values. Our Test 9's random values in our 2 sample runs' output must be different. Updated: 10/29/2018 6:00 AM Please ask questions, if any, during the in-class discussions and demos for this assignment. 1. removeSecondNode340 deletes the second node in the Linked Bag. 2 pts 2. addEnd340 inserts the new node at the end of the Linked Bag. 2 pts 3. getCurrentSize340Iterative counts the number of nodes in the Linked Bag iteratively. 2 pts 4. getcurrentsize340Recursive counts the number of nodes in the Linked Bag recursively. Use 1 helper function: getcurrentsize340RecursiveHelper. 2 pts 5 IMMEDIATE RECURSION: getcurrentSize340RecursiveNoHelper counts the number of nodes in the Linked Bag recursively. This recursive function does not use any helper functions. 4 pts getFrequencyof340Recursive recursively counts the number of times an entry appears in the Linked Bag. Use 1 helper function: getFrequencyof340RecursiveHelper. 2 pts IMMEDIATE RECURSION: entry appears in the Linked Bag. This recursive function does not use any helper functions. 4 pts removeRandom340 removes a random entry from the Linked Bag. 2 pts 6. 7. getFrequencyof340RecursiveNoHelper recursively counts the number of times an 8. PART B-Linked Bag. 20 points Please change only files: LinkedBag340.cpp and Include.h, no other files. We are to implement 8 small additional functions and 2 helper functions to the Linked Bag. Our programs must produce identical output to the output in the 2 sample runs: Asmt03_Runl.txt and Asmt03_Run2.txt Our Test 9's output must also be identical to the sample output excepts the random values. Our Test 9's random values in our 2 sample runs' output must be different. Updated: 10/29/2018 6:00 AM Please ask questions, if any, during the in-class discussions and demos for this assignment. 1. removeSecondNode340 deletes the second node in the Linked Bag. 2 pts 2. addEnd340 inserts the new node at the end of the Linked Bag. 2 pts 3. getCurrentSize340Iterative counts the number of nodes in the Linked Bag iteratively. 2 pts 4. getcurrentsize340Recursive counts the number of nodes in the Linked Bag recursively. Use 1 helper function: getcurrentsize340RecursiveHelper. 2 pts 5 IMMEDIATE RECURSION: getcurrentSize340RecursiveNoHelper counts the number of nodes in the Linked Bag recursively. This recursive function does not use any helper functions. 4 pts getFrequencyof340Recursive recursively counts the number of times an entry appears in the Linked Bag. Use 1 helper function: getFrequencyof340RecursiveHelper. 2 pts IMMEDIATE RECURSION: entry appears in the Linked Bag. This recursive function does not use any helper functions. 4 pts removeRandom340 removes a random entry from the Linked Bag. 2 pts 6. 7. getFrequencyof340RecursiveNoHelper recursively counts the number of times an 8