#include using namespace std;

class listNode{ private: int value; listNode* next;

public: listNode(int newValue){ value = newValue; next = NULL; }

void print(){ cout

friend class linkedList; };

class linkedList{ private: listNode* head; int size;

public: linkedList(){ //constructor function creates an empty linked list head = NULL; size = 0; }

void addBack(int newValue){ //we are creating a new node in the heap listNode* newNode = new listNode(newValue); if(head == NULL){ head = newNode; }else{ listNode* current = head; for(int i=0; inext; } //here current pointer is pointing to the last Node current->next = newNode; } size++; }

void removeBack(){ if(size == 0){ cout next; } delete current->next; current->next = NULL; } size--; }

void insertAt(int newValue, int index){ if(index >= 0 && index next = head; head = newNode; } else{ listNode* current = head; for(int i=0; inext;

newNode->next = current->next; current->next = newNode; } size++; }else{ cout

void removeAt(int index){ if(index >= 0 && index next; }else{ listNode* current = head; for(int i=0; inext; delNode = current->next; current->next = current->next->next; } delete delNode; size--; }else{ cout

void print(){ listNode* current = head; for(int i=0;ivalue next; } cout

int main(){

linkedList myList;

myList.addBack(5); myList.print(); myList.addBack(1); myList.print(); myList.addBack(7); myList.print(); myList.addBack(3); myList.print(); myList.addBack(6); myList.print(); myList.addBack(4); myList.print();

myList.removeAt(3); myList.print(); myList.removeAt(0); myList.print();

// myList.insertAt(8,3); myList.print(); // myList.insertAt(6,0); myList.print(); // myList.insertAt(10,1); myList.print(); // // myList.insertAt(15,-1); myList.print(); // myList.insertAt(25,100); myList.print();

// myList.addBack(3); myList.print(); // myList.addBack(6); myList.print(); // myList.addBack(4); myList.print(); // // myList.insertAt(8,3); myList.print(); // myList.insertAt(12,1); myList.print(); // myList.insertAt(35,6); myList.print();

// myList.removeBack(); myList.print(); // myList.removeBack(); myList.print(); // myList.removeBack(); myList.print(); // myList.removeBack(); myList.print(); // myList.removeBack(); myList.print(); // myList.removeBack(); myList.print(); // myList.removeBack(); myList.print();

return 0; }

use it to implement Classroom.cpp, etc. There are some functions in that class that you dont need or there are some which requires some modifications.

three C++ source files:

• Classroom.h
• Classroom.cpp
• main.cpp

name In this homework, you will implement a single linked list to store a list of students. Every student has an ID, a name, and a major. You will create 2 classes: Student and Classroom. Student class should have all above attributes and also a next pointer. Student Type Attribute String ID String String major Student* Classroom class should have a head node as an attribute to keep the list of the students. Also, following member functions should be implemented in this class: Classroom Type Attribute Student* head next Return Type void void void void Student int bool Function constructor addStudent(string id, string name, string major) removeStudent (string id) print() print(string id) at(int index) getSize() isEmpty() addStudent...): Adds a new student to the list. removeStudent...): This functions will remove a student using the given id number. If the given id number is not in the list, it will give an error. print(): Print all students in order.id, name, and the major should be printed for each student. print(string id): Prints all information of a student for a given id at(int index): Returns the student at given index getSize(): returns the number of students in the list isEmpty(): returns true if list is empty, returns false otherwise. You will implement the Student and Classroom classes along with a main.cpp file. I expect you to have 3 files: Classroom.h, Classroom.cpp, and main.cpp. Student class definition will be in the Classroom.h file. main.cpp includes following operations in the main function. 1. Add following students to the list using addStudent (string id, string name, string major) A25123 Izzie Cline Bridget McCann A23452 Mathematics Computer Science History A45120 Isa Powell A56009 Nick Miller Computer Science A65980 Alannah Wilks Literature A45018 Montana Gates Biology A86003 Janet Newman Nursing 2. Print the list of the students in order using Print() 3. Remove Janet Newman from the list using removeStudent (string id) 4. Print Janet Newman information (you should give error message since Janet Newman is already removed) 5. Print the list of the students in order using Print() Additional Resources: In addition, I have provided an integer single linked list C++ class to help you to study for linked lists. This code is given you for a reference to use it in this assignment. You should study the code and update the functions to implement the hw assignment. There are some functions in that class that you don't need or there are some which requires some modifications