In haskell: Code the init function for lists, using the built-in reverse function for lists. What would be the best way to handle an empty list?

I need help with this C++ question  Write a program that uses Stacks and/or Queues from the C++ Standard Template Library (STL) to reverse a word entered by the user (you cannot use arrays).

I need help being able to make a function that adds an item to the back of a doubly linked list to add an animal to the end of the list in C++ Here's what I got so far with the code #include <iostream> #include <string> using namespace std;   class node { public:     string data;// Data item     node* next; // Point to next node };   class linkedList { public:          // Variables? (Attributes)     node* headptr;          // Functions (methods)     linkedList()     {         headptr = nullptr;     }          // Add an item to front of list     void addFront(string x)     {         // Declare a pointer variable         node* p;                  // Create a new node, and store its address in p         p = new node;                  // Put x into data field of the new node         // Can also put p -> data = x, same thing.         (*p).data = x;                  // Set next pointer of node to previous front item         (*p).next = headptr;                  //Update the…

In Haskell, use list comprehension to return all the numbers greater than 18 and divisible by 2 in the list [12, 24, 25, 28, 30, 33, 35]. SHOW OUTPUT AND SOURCE CODE