can you fix the following code please.

#include #include

class Currency { protected: int whole; int fraction; virtual std::string get_name() = 0;

public: Currency() { whole = 0; fraction = 0; } Currency(double value) { if (value

int get_fraction() { return fraction; }

void set_whole(int w) { if (w >= 0) whole = w; }

void set_fraction(int f) { if (f >= 0 && f

void add(const Currency* curr) { whole += curr->whole; fraction += curr->fraction; if (fraction > 100) { whole++; fraction %= 100; } }

void subtract(const Currency* curr) { if (!isGreater(*curr)) throw "Invalid Subtraction"; whole -= curr->whole; if (fraction fraction) { fraction = fraction + 100 - curr->fraction; whole--; } else { fraction -= curr->fraction; } }

bool isEqual(const Currency& curr) { return curr.whole == whole && curr.fraction == fraction; }

bool isGreater(const Currency& curr) { if (whole

void print() { std::cout

class Krone : public Currency { protected: std::string name = "Krone"; std::string get_name() { return name; } public: Krone() : Currency() { } Krone(double value) : Currency(value) { } Krone(Krone& curr) : Currency(curr) { } };

class Soum : public Currency { protected: std::string name = "Soum"; std::string get_name() { return name; } public: Soum() : Currency() { } Soum(double value) : Currency(value) { } Soum(Krone& curr) : Currency(curr) { } };

class LinkNode { protected: Currency* data; LinkNode* next; public: LinkNode(Currency* c) { data = c; next = nullptr; }

Currency* get_data() { return data; }

void set_data(Currency* c) { data = c; }

LinkNode* get_next() { return next; }

void set_next(LinkNode* n) { next = n; } }; class SinglyLinkedList { private: int count; LinkNode* head; LinkNode* tail; public: SinglyLinkedList() { count = 0; head = nullptr; tail = nullptr; }

~SinglyLinkedList() { destroyList(); }

void createList() { count = 0; head = nullptr; tail = nullptr; }

void destroyList() { while (head != nullptr) { LinkNode* temp = head; head = head->next; delete temp; } count = 0; tail = nullptr; }

bool isEmpty() { return head == nullptr; }

int size() { return count; }

void addToHead(int val) { LinkNode* newHead = new LinkNode(val); if (isEmpty()) { tail = newHead; } newHead->next = head; head = newHead; count++; }

void addToTail(int val) { LinkNode* newTail = new LinkNode(val); if (isEmpty()) { head = newTail; } else { tail->next = newTail; } tail = newTail; count++; }

int removeHead() { if (isEmpty()) { throw "List is empty"; } LinkNode* oldHead = head; int val = oldHead->data; head = oldHead->next; if (isEmpty()) { tail = nullptr; } delete oldHead; count--; return val; }

void printList() { LinkNode* current = head; while (current != nullptr) { std::cout data next; } std::cout

Currency arr[20] = { Currency("Kr", 57.12), Currency("Kr", 23.44), Currency("Kr", 87.43), Currency("Kr", 68.99), Currency("Kr", 111.22), Currency("Kr", 44.55), Currency("Kr", 77.77), Currency("Kr", 18.36), Currency("Kr", 543.21), Currency("Kr", 20.21), Currency("Kr", 345.67), Currency("Kr", 36.18), Currency("Kr", 48.48), Currency("Kr", 101.00), Currency("Kr", 11.00), Currency("Kr", 21.00), Currency("Kr", 51.00), Currency("Kr", 1.00), Currency("Kr", 251.00), Currency("Kr", 151.00) };

SinglyLinkedList list; Stack stack; Queue queue;

for (int i = 6; i >= 0; i--) { list.insertAtEnd(arr[i]); }

int index1 = list.search(arr[2]); int index2 = list.search(Currency("Kr", 44.56)); cout

// Remove objects from linked list list.removeNode(arr[4]); list.removeNodeAt(2);

// Print contents of linked list cout

for (int i = 8; i

int countCurrency = list.getCount(); list.removeNodeAt(countCurrency % 6); list.removeNodeAt(countCurrency / 7);

cout

for (int i = 13; i

cout

// Pop objects from stack stack.pop(); stack.pop(); stack.pop();

cout

for (int i = 0; i

stack.pop(); stack.pop();

cout

for (int i = 0; i

// Enqueue more objects to queue for (int i = 6; i

cout

queue.dequeue(); queue.dequeue(); queue.dequeue();

cout

return 0; }

1. A LinkNode structure or class which will have two attributes - - a data attribute, and - a pointer attribute to the next node. a The data attribute of the LinkNode should be a reference/pointer af the Currency class of Lab 2. - Do not make it an inner class or member structure to the SinglyLinkedList class of \#2 below. 2. A SinglyLinkedList class which will be composed of three attributes - - a count attribute, - a LinkNode pointer/reference attribute named as and pointing to the start of the list and - a LinkNode pointer/reference attribute named as and pointing to the end of the list. - Since this is a class, make sure all these attributes are private. 3. The class and attribute names for the node and linked list are the words in bold in #1 and $2. 4. For the Linked List, implement the following linked-list behaviors as explained in class - - getters/setter5/constructors/destructors, as needed, for the attributes of the class. a createList method in addition to the constructor - this is optional for overloading purposes. a destroyList method in place of or in addition to the destructor - this is optional for overloading purposes. - addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index. - removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency. - removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency. - findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list. - getCurrency method which takes an index values as a parameter and returns the Currency object. a printList method which returns a string of all the Currency abjects in the list in the order of index, tab spaced. - isListEmpty method which returns if a list is empty or not. a countCurrency method which returns a count of Currency nodes in the list. - Any other methods you think would be useful in your program. 5. A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods - - constructor and createStack (optional) methods. o push which takes a Currency object as parameter and adds it to the top of the stack. - pop which takes no parameter and removes and returns the Currency object from the top of the stack. - peek which takes no parameter and returns a copy of the Currency object at the top of the stack. a printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced. - destructor and/or destroystack (optional) methods. - Ensure that the Stack objects do not allow Linked List functions to be used on them. 6. A Queue class derived from the SinglyLinkedList but with no additional attributes and the usual queue methods - - constructor and createQueue (optional) methods, - enqueue which takes a Currency object as parameter and adds it to the end of the queue. - dequeue which takes no parameter and removes and returns the Currency object from the front of the queue. - peekFront which takes no parameter and returns a copy of the Currency object at the front of the queue. a peekRear which takes no parameter and returns a copy of the Currency object at the end of the queue. - printQueue method which returns a string signifying the contents of the queue from front to end, tab spaced. - destructor and/or destroyQueue (optional) methods. - Ensure that the Queue objects do not allow Linked List functions to be used on them. 8. Then write a main driver program that will demonstrate all the capabilities of your ADTs as follows - - First, print a Welcome message for the demonstration of your ADTs - you can decide what the message says but it should include your full name(s). - Second, create the following twenty (20) Krone objects in a Currency array to be used in the program. 1. Kr57.12 2. Kr23.44 3. Kr87.43 4. Kr68.99 5. Kr 111.22 6. Kr44.55 7. Kr77.77 8. Kr18.36 9. Kr543.21 10. Kr20.21 11. Kr345.67 12. Kr36.18 13. Kr48.48 14. Kr101.00 15. Kr11.00 16. Kr21.00 17. Kr51.00 18. Kr1.00 19. Kr251.00 20. Kr151.00 - Then, create one each of SinglyLinkedList, Stack and Queue objects. - For the linked list, perform the following operations in order - A. Add the first seven (7) objects from the array into the linked list in order such that they end up in the reverse order in the linked list, i.e. the seventh element as first node and first element as seventh node. If it is easier, you are allowed to insert copies of the objects. B. Search for Kr87.43 followed by Kr44.56 - print the results of each. C. Remove the node containing Kr111.22 followed by the node at index 2. D. Print the contents of the list. E. Then add the next four (4) objects (\#9 thru 12) such that their index in the linked list is calculated as (index in array \% 5). F. Remove two (2) objects at indexes (countCurrency \% 6) and (countCurrency / 7) in that order. G. Print the contents of the list. - For the stack, perform the following operations in order - A. Push seven (7) objects starting from the array index 13 onwards to the stack. B. Peek the top of the stack - print the result. C. Perform three (3) pops in succession. D. Print the contents of the stack. E. Push five (5) more objects from the start of the objects array to the stack. F. Pop twice in succession. G. Print the contents of the stack. - For the queue, perform the following operations in order - A. Enqueue the seven (7) objects at odd indexes starting from index 5 in the array. B. Peek the front and end of the queue - print the results. C. Perform two (2) dequeues in succession. D. Print the contents of the queue. E. Enqueue five (5) more objects from the index 10 in the array. F. Dequeue three times in succession. G. Print the contents of the queue. - End the program with a leaving message of your choice. Remember to clean up before the program ends. - Restrict all your input / output to the main driver program only, except for the existing screen print inside the Currency print methods