NEED HELP ON THESE ASAP.

WOULD REALLY APPRICIATE IT.

THANKS!

1. Write a syntactically correct recursive C++ function same(a,b,low,high) that returns true if the array segments a[low..high]and b[low..high] are identical, false otherwise. (Assume the arrays contain integers.)
2. Give appropriate declarations for a simple singly-linked list. (Assume these declarations in questions 4, 5, and 7.)
3. Present two ways to refer to the field that contains 42 in the following structure.

4. Write a recursive C++ function that builds our first example linked list (pictured) and returns a pointer to its first Node.

5. 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.)
6. 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.)
7. Why must we use a friend function when we overload the << operator in a class that implements an ordered list using a linked list?
8. Describe (no code) an algorithm that, using a stack, reads a sequence of integers from the terminal and then prints them out in reverse order.