Given a Singly Linked List, write a function reverse() that reverses the list. Also determine the complexity of your function in terms of Big-Oh notation. While reversing the list, you must not use...

In C++ Programming Please

Extracted text: Given a Singly Linked List, write a function reverse() that reverses the list. Also determine the complexity of your function in terms of Big-Oh notation. While reversing the list, you must not use any additional list or arrays. For example, the given list is: head → 1→2→3→4→ 5→ NULL The output should be: head → 5→ 4 → 3 → 2→ 1→ NULL While writing the function, consider the following Node class. class Node{ public: int key; Node* next;