2. Write a syntactically correct recursive C++ function same (a,below, high) that returns true if the array segments a low..high and b[low..high] are identical, false otherwise. (Assume the arrays contain integers.) 3. Give appropriate declarations for a simple singly-linked list. (Assume these declarations in questions 4, 5, and 7.) 4. Present two ways to refer to the field that contains 42 in the following structure. first 33 42 51 58 5. Write a recursive C++ function that builds our first example linked list (pictured) and returns a pointer to its first Node. first --- 10 6. 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.)