For this question, consider the following partial definition of a Linked List class: struct Node{ int value: Node* next: }: class LL { private: Node* head: public: LL(): void insertHead(int x): int remove Tail(): void scale List (int factor): }: LL:: LL() {head = NULL;} Write an implementation for the insert Head method which will insert a new list element at the front of the list. Write an implementation of remove Tail which will remove the last Node from the list and return its value. If the list is empty, your method should print an error message and return "0". Write an implementation of scale List which will multiply each list element by the argument 'factor