Question 3. Queues [9]

Provide working implementations for the enqueue and dequeue methods in the Queue class defined below. Do not change the class definition.
(Note there is no back pointer for the class and no prev pointer in the struct.)

class Queue {
   private:
      struct node {
         float data;
         node *next;  
      } *front; // points to the front node in the queue,
                // NULL if the queue is empty
   public:
      Queue();  // initialize an empty queue
     ~Queue();  // deallocate all remaining nodes

      // enqueue d at the back of the queue
      bool enqueue(float d); 

      // dequeue d from the front of the queue
      bool dequeue(float &d);
};