The points to the first node in a linked list. To indicate that a linked list it empty, you should set the pointer to its head to the value. In a (n) list the last node has a pointer to the first node. In a (n) list, each node has a pointer to the one before 4 and the one after it. Consider the following function to the nth Fibonacci number. long fib (long num) {if (num = = 01] num = = 1) return num. return (fib (nun - 1) + fib (num - 2));} What are the base cases and recursive cases? Write a recursive function that given a value. maxVal, returns the summation from 1 to maxVal