A linked list class uses a Node class to represent nodes. A private recursive method Node add(int index, E element, Node list) takes a reference list (referring to the first in a chain of Node objects), adds a node containing the given element at the given index, and returns a reference to the first node of the resulting chain. Assume that index is nonnegative and is less than or equal to the size of list. Under these circumstances, the add method should handle its base case (index is 0) by

A) returning list
B) adding a new node containing element to the front of list and returning a reference to the newly added node
C) adding a new node containing element to the front of list and returning list
D) adding a new node containing element to the end of list

B) adding a new node containing element to the front of list and returning a reference to the newly added node