1. In what two ways is a linked list implementation of an ordered list ADT more efficient than an array-based implementation? (Consider space and time.)

2. A circularly-linked list with a header node uses the same declarations as a simple singly-linked list. Write a C++ function that returns the length of an ordered list represented by such a structure. This function should be iterative. (Hint: Off-line, sketch a picture.)

3. Why must we use a friend function when we overload the << operator in a class that implements an ordered list using a linked list?

Need help with these 3 questions. Thank you