5. (10 points) Suppose that you have a SLL without a tail pointer. Write a O(n) function to reverse the list. The class SLL contains only a single pointer head. Each Node in the list contains a pointer next to the next element. void SLL:: reverse() { 8. [10 points) Examine the following function which implements a destructor for a singly linked list class SLL. Is there a bug? If yes, how would you fix it? SLL:: SLL() { Node +p = head; // go through list and remove all the nodes while (p != NULL) { delete p; p = next